Home
last modified time | relevance | path

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

12

/external/llvm/lib/Analysis/
DSparsePropagation.cpp122 SmallVectorImpl<bool> &Succs, in getFeasibleSuccessors() argument
124 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
129 Succs[0] = true; in getFeasibleSuccessors()
142 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
153 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
158 Succs[C->isNullValue()] = true; in getFeasibleSuccessors()
165 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
170 Succs.assign(Succs.size(), true); in getFeasibleSuccessors()
184 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
195 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
[all …]
/external/llvm/lib/CodeGen/
DScheduleDAG.cpp80 for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(), in addPred()
81 EE = PredSU->Succs.end(); II != EE; ++II) { in addPred()
122 N->Succs.push_back(P); in addPred()
142 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(), in removePred()
143 N->Succs.end(), P); in removePred()
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!"); in removePred()
145 N->Succs.erase(Succ); in removePred()
185 for (SUnit::const_succ_iterator I = SU->Succs.begin(), in setDepthDirty()
186 E = SU->Succs.end(); I != E; ++I) { in setDepthDirty()
275 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), in ComputeHeight()
[all …]
DLatencyPriorityQueue.cpp77 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()
DTailDuplication.cpp105 SmallSetVector<MachineBasicBlock*, 8> &Succs);
216 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(), in TailDuplicateAndUpdate() local
234 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); in TailDuplicateAndUpdate()
466 SmallSetVector<MachineBasicBlock*,8> &Succs) { in UpdateSuccessorsPHIs() argument
467 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(), in UpdateSuccessorsPHIs()
468 SE = Succs.end(); SI != SE; ++SI) { in UpdateSuccessorsPHIs()
688 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(), in duplicateSimpleBB() local
700 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
DMachineSink.cpp545 auto Succs = AllSuccessors.find(MBB); in GetAllSortedSuccessors() local
546 if (Succs != AllSuccessors.end()) in GetAllSortedSuccessors()
547 return Succs->second; in GetAllSortedSuccessors()
DScheduleDAGInstrs.cpp674 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end(); in iterateChainSucc()
707 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(), in adjustChainDeps()
708 JE = (*I)->Succs.end(); J != JE; ++J) in adjustChainDeps()
1531 for (SUnit::const_succ_iterator SI = PredSU->Succs.begin(), in joinPredSubtree()
1532 SE = PredSU->Succs.end(); SI != SE; ++SI) { in joinPredSubtree()
1596 SI = SU->Succs.begin(), SE = SU->Succs.end(); SI != SE; ++SI) { in hasDataSucc()
DMachineScheduler.cpp571 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
1347 SI = SUa->Succs.begin(), SE = SUa->Succs.end(); SI != SE; ++SI) { in clusterNeighboringLoads()
1435 if (!SU.Succs.empty()) in apply()
1586 I = LastLocalSU->Succs.begin(), E = LastLocalSU->Succs.end(); in constrainLocalCopy()
2927 SmallVectorImpl<SDep> &Deps = isTop ? SU->Preds : SU->Succs; in reschedulePhysRegCopies()
2936 if (isTop ? DepSU->Succs.size() > 1 : DepSU->Preds.size() > 1) in reschedulePhysRegCopies()
3352 || Node->Succs.size() > ViewMISchedCutoff); in isNodeHidden()
DPostRASchedulerList.cpp474 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ReleaseSuccessors()
/external/clang/test/Analysis/
Dblocks.mm16 // CHECK-NEXT: Succs (1): B1
22 // CHECK-NEXT: Succs (1): B0
40 // CHECK-NEXT: Succs (1): B1
48 // CHECK-NEXT: Succs (1): B0
63 // CHECK-NEXT: Succs (1): B1
72 // CHECK-NEXT: Succs (1): B0
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h121 NodeGroup Succs; variable
127 : Location(loc), State(state), Succs(IsSink) { in ExplodedNode()
178 unsigned succ_size() const { return Succs.size(); } in succ_size()
180 bool succ_empty() const { return Succs.empty(); } in succ_empty()
183 bool isSink() const { return Succs.getFlag(); } in isSink()
217 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
218 succ_iterator succ_end() { return Succs.end(); } in succ_end()
240 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); } in replaceSuccessor()
/external/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp110 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in numberRCValSuccInSU()
147 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in numberCtrlDepsInSU()
235 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in push()
274 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(), in isResourceAvailable()
275 E = Packet[i]->Succs.end(); I != E; ++I) { in isResourceAvailable()
525 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in scheduledNode()
543 HorizontalVerticalBalance += (SU->Succs.size() - numberCtrlDepsInSU(SU)); in scheduledNode()
DScheduleDAGFast.cpp194 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
295 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
365 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
402 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
541 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
DScheduleDAGRRList.cpp740 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
851 for (auto &Succ : SU->Succs) { in UnscheduleNodeBottomUp()
865 for (auto &Succ2 : SU->Succs) { in UnscheduleNodeBottomUp()
1039 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1119 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1159 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
1506 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
2142 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()
2204 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in closestSucc()
2258 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in hasOnlyLiveOutUses()
[all …]
DScheduleDAGVLIW.cpp142 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
/external/llvm/lib/Target/WebAssembly/
DWebAssemblyCFGStackify.cpp107 SmallVector<MachineBasicBlock *, 0> Succs; member
121 : MBB(MBB), Succs(MBB->successors()) { in POStackEntry()
129 Succs.begin(), Succs.end(), in POStackEntry()
187 SmallVectorImpl<MachineBasicBlock *> &Succs = Entry.Succs; in SortBlocks() local
188 if (!Succs.empty()) { in SortBlocks()
189 MachineBasicBlock *Succ = Succs.pop_back_val(); in SortBlocks()
/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp66 if (Packet[i]->Succs.size() == 0) in isResourceAvailable()
68 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(), in isResourceAvailable()
69 E = Packet[i]->Succs.end(); I != E; ++I) { in isResourceAvailable()
251 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseBottomNode()
451 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in getSingleUnscheduledSucc()
512 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in SchedulingCost()
DHexagonVLIWPacketizer.cpp806 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in restrictingDepExistInPacket()
807 auto &Dep = PacketSU->Succs[i]; in restrictingDepExistInPacket()
871 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in arePredicatesComplements()
872 auto Dep = PacketSU->Succs[i]; in arePredicatesComplements()
1209 for (unsigned i = 0; i < SUJ->Succs.size(); ++i) { in isLegalToPacketizeTogether()
1213 if (SUJ->Succs[i].getSUnit() != SUI) in isLegalToPacketizeTogether()
1216 SDep::Kind DepType = SUJ->Succs[i].getKind(); in isLegalToPacketizeTogether()
1241 DepReg = SUJ->Succs[i].getReg(); in isLegalToPacketizeTogether()
1248 if (!isCallDependent(I, DepType, SUJ->Succs[i].getReg())) in isLegalToPacketizeTogether()
1328 unsigned DepReg = SUJ->Succs[i].getReg(); in isLegalToPacketizeTogether()
/external/clang/include/clang/Analysis/
DCFG.h474 AdjacentBlocks Succs; variable
493 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
541 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
542 succ_iterator succ_end() { return Succs.end(); } in succ_end()
543 const_succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
544 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end()
546 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } in succ_rbegin()
547 succ_reverse_iterator succ_rend() { return Succs.rend(); } in succ_rend()
548 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } in succ_rbegin()
549 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); } in succ_rend()
[all …]
/external/llvm/lib/Transforms/IPO/
DPruneEH.cpp267 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB)); in DeleteBasicBlock() local
269 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in DeleteBasicBlock()
270 Succs[i]->removePredecessor(BB); in DeleteBasicBlock()
/external/llvm/lib/Transforms/Scalar/
DSCCP.cpp445 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs);
527 SmallVectorImpl<bool> &Succs) { in getFeasibleSuccessors() argument
528 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
531 Succs[0] = true; in getFeasibleSuccessors()
541 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
546 Succs[CI->isZero()] = true; in getFeasibleSuccessors()
552 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
558 Succs[0] = true; in getFeasibleSuccessors()
567 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
571 Succs[SI->findCaseValue(CI).getSuccessorIndex()] = true; in getFeasibleSuccessors()
[all …]
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp221 V->Succs.addNode(this, G); in addPredecessor()
427 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end(); in trim()
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h276 SmallVector<SDep, 4> Succs; // All sunit successors.
467 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
468 if (Succs[i].getSUnit() == N)
/external/llvm/lib/Target/AMDGPU/
DR600Packetizer.cpp200 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) { in isLegalToPacketizeTogether()
201 const SDep &Dep = SUJ->Succs[i]; in isLegalToPacketizeTogether()
/external/llvm/include/llvm/Analysis/
DSparsePropagation.h191 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
/external/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp120 const UniqueVector<BasicBlock*>&Succs);
714 const UniqueVector<BasicBlock *> &Succs) { in buildEdgeLookupTable() argument
720 size_t TableSize = Succs.size() * Preds.size(); in buildEdgeLookupTable()
739 EdgeTable[((Succs.idFor(Succ) - 1) * Preds.size()) + in buildEdgeLookupTable()

12