Home
last modified time | relevance | path

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

1234

/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/swiftshader/third_party/LLVM/lib/Analysis/
DSparsePropagation.cpp121 SmallVectorImpl<bool> &Succs, in getFeasibleSuccessors() argument
123 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
128 Succs[0] = true; in getFeasibleSuccessors()
141 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
152 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
157 Succs[C->isNullValue()] = true; in getFeasibleSuccessors()
164 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
169 Succs.assign(Succs.size(), true); in getFeasibleSuccessors()
183 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
194 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()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DSparsePropagation.h192 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
289 TerminatorInst &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()
334 Succs.assign(Succs.size(), true); in getFeasibleSuccessors()
339 Succs.assign(Succs.size(), true); in getFeasibleSuccessors()
354 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
[all …]
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DScheduleDAG.cpp114 N->Succs.push_back(P); in addPred()
135 for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(), in removePred()
136 EE = N->Succs.end(); II != EE; ++II) in removePred()
139 N->Succs.erase(II); in removePred()
175 for (SUnit::const_succ_iterator I = SU->Succs.begin(), in setDepthDirty()
176 E = SU->Succs.end(); I != E; ++I) { in setDepthDirty()
265 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), in ComputeHeight()
266 E = Cur->Succs.end(); I != E; ++I) { in ComputeHeight()
326 if (Succs.size() != 0) { in dumpAll()
328 for (SUnit::const_succ_iterator I = Succs.begin(), E = Succs.end(); in dumpAll()
[all …]
DLatencyPriorityQueue.cpp76 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in push()
92 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduledNode()
DScheduleDAGEmit.cpp46 for (SUnit::const_succ_iterator II = SU->Succs.begin(), in EmitPhysRegCopy()
47 EE = SU->Succs.end(); II != EE; ++II) { in EmitPhysRegCopy()
/external/swiftshader/third_party/LLVM/tools/llvm-objdump/
DMCFunction.h51 SetTy Succs; variable
56 succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
57 succ_iterator succ_end() const { return Succs.end(); } in succ_end()
59 bool contains(uint64_t Addr) const { return Succs.count(Addr); } in contains()
62 void addSucc(uint64_t Addr) { Succs.insert(Addr); } in addSucc()
/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/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
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()
185 N->Succs.erase(Succ); in removePred()
223 for (SDep &SuccDep : SU->Succs) { in setDepthDirty()
302 for (const SDep &SuccDep : Cur->Succs) { in ComputeHeight()
386 if (Succs.size() != 0) { in dumpAll()
388 for (const SDep &Dep : Succs) { in dumpAll()
485 unsigned Degree = SU.Succs.size(); in InitDAGTopologicalSorting()
[all …]
DLatencyPriorityQueue.cpp78 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in push()
94 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in scheduledNode()
DMacroFusion.cpp44 for (SDep &SI : FirstSU.Succs) in fuseInstructionPair()
61 for (SDep &SI : FirstSU.Succs) in fuseInstructionPair()
78 for (const SDep &SI : FirstSU.Succs) { in fuseInstructionPair()
104 if (SU.Succs.empty()) in fuseInstructionPair()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h122 NodeGroup Succs; variable
127 : Location(loc), State(std::move(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()
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/
DLoopUnswitch.cpp828 SmallVector<BasicBlock*, 4> Succs; in RemoveBlockIfDead() local
830 Succs.push_back(TI->getSuccessor(i)); in RemoveBlockIfDead()
835 array_pod_sort(Succs.begin(), Succs.end()); in RemoveBlockIfDead()
836 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end()); in RemoveBlockIfDead()
845 for (unsigned i = 0; i != Succs.size(); ++i) in RemoveBlockIfDead()
846 if (pred_begin(Succs[i]) != pred_end(Succs[i])) { in RemoveBlockIfDead()
852 if (!LI->isLoopHeader(Succs[i])) { in RemoveBlockIfDead()
853 Succs.erase(Succs.begin()+i); in RemoveBlockIfDead()
858 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in RemoveBlockIfDead()
859 RemoveBlockIfDead(Succs[i], Worklist, L); in RemoveBlockIfDead()
/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()
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DScheduleDAGFast.cpp188 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
290 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
358 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
395 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
530 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
DScheduleDAGRRList.cpp623 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
689 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in UnscheduleNodeBottomUp()
868 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
946 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
986 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
1272 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
1336 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ReleaseSuccessors()
2018 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in UnscheduledNode()
2080 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in closestSucc()
2134 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in hasOnlyLiveOutUses()
[all …]
/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/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp71 if (SUd->Succs.size() == 0) in hasDependence()
81 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()
DHexagonSubtarget.cpp153 for (SDep &SI : SU.Succs) { in apply()
349 MachineInstr *DDst = Dst->Succs[0].getSUnit()->getInstr(); in adjustSchedDependency()
421 for (auto &I : Src->Succs) { in restoreLatency()
460 for (auto &I : Src->Succs) { in changeLatency()
507 if (getZeroLatency(Dst, Dst->Succs) != nullptr) in isBestZeroLatency()
516 DstBest = getZeroLatency(Src, Src->Succs); in isBestZeroLatency()
563 for (auto &I : SrcBest->Succs) in isBestZeroLatency()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Vectorize/
DVPlan.cpp350 std::vector<BasicBlock *> Succs(succ_begin(BB), succ_end(BB)); in updateDominatorTree() local
351 assert(Succs.size() <= 2 && in updateDominatorTree()
353 PostDomSucc = Succs[0]; in updateDominatorTree()
354 if (Succs.size() == 1) { in updateDominatorTree()
360 BasicBlock *InterimSucc = Succs[1]; in updateDominatorTree()
362 PostDomSucc = Succs[1]; in updateDominatorTree()
363 InterimSucc = Succs[0]; in updateDominatorTree()
/external/llvm/lib/Target/WebAssembly/
DWebAssemblyFixIrreducibleControlFlow.cpp85 SmallVector<MachineBasicBlock *, 2> Succs; member in __anon4a28f1dd0211::MetaBlock
90 Succs(MBB->succ_begin(), MBB->succ_end()) {} in MetaBlock()
93 Loop->getExitBlocks(Succs); in MetaBlock()
105 return Succs; in successors()

1234