HomeSort by: relevance | last modified time | path
    Searched refs:Succs (Results 1 - 25 of 47) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
SparsePropagation.h 191 void getFeasibleSuccessors(Instruction &TI, SmallVectorImpl<bool> &Succs,
288 Instruction &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) {
289 Succs.resize(TI.getNumSuccessors());
295 Succs[0] = true;
310 Succs[0] = Succs[1] = true;
323 Succs[0] = Succs[1] = true;
328 Succs[C->isNullValue()] = true;
334 Succs.assign(Succs.size(), true)
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 131 /// Succs - The successors of this node.
132 NodeGroup Succs;
139 : Location(loc), State(std::move(state)), Succs(IsSink), Id(Id) {
199 unsigned succ_size() const { return Succs.size(); }
201 bool succ_empty() const { return Succs.empty(); }
204 bool isSink() const { return Succs.getFlag(); }
251 succ_iterator succ_begin() { return Succs.begin(); }
252 succ_iterator succ_end() { return Succs.end(); }
253 succ_range succs() { return {Succs.begin(), Succs.end()}; function in class:clang::ento::ExplodedNode
261 const_succ_range succs() const { return {Succs.begin(), Succs.end()}; } function in class:clang::ento::ExplodedNode
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
LatencyPriorityQueue.cpp 76 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
92 for (const SDep &Succ : SU->Succs)
ScheduleDAG.cpp 122 for (SDep &SuccDep : PredSU->Succs) {
167 N->Succs.push_back(P);
184 SmallVectorImpl<SDep>::iterator Succ = llvm::find(N->Succs, P);
185 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
186 N->Succs.erase(Succ);
224 for (SDep &SuccDep : SU->Succs) {
303 for (const SDep &SuccDep : Cur->Succs) {
343 dbgs() << " # succs left : " << NumSuccsLeft << "\n";
347 dbgs() << " # weak succs left : " << WeakSuccsLeft << "\n"
    [all...]
MacroFusion.cpp 58 for (SDep &SI : FirstSU.Succs)
83 for (SDep &SI : FirstSU.Succs)
100 for (const SDep &SI : FirstSU.Succs) {
126 if (SU.Succs.empty())
MachinePipeliner.cpp 692 for (auto &SI : SU->Succs) {
1227 for (auto &SI : SUnits[i].Succs) {
1398 for (auto &Dep : PHISUs[Index]->Succs) {
1483 for (SUnit::const_succ_iterator IS = SU->Succs.begin(),
1484 ES = SU->Succs.end();
1536 for (const SDep &Succ : (*I)->Succs) {
1552 SmallSetVector<SUnit *, 8> &Succs,
1554 Succs.clear();
1557 for (SDep &Succ : (*I)->Succs) {
1563 Succs.insert(Succ.getSUnit())
    [all...]
WasmEHPrepare.cpp 201 SmallVector<BasicBlock *, 4> Succs(successors(BB));
206 eraseDeadBBsAndChildren(Succs, &DTU);
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyLateEHPrepare.cpp 103 SmallVector<MachineBasicBlock *, 4> Succs(MBB->successors());
105 for (auto *Succ : Succs)
278 SmallVector<MachineBasicBlock *, 8> Succs(MBB.successors());
279 for (auto *Succ : Succs)
282 eraseDeadBBsAndChildren(Succs);
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUExportClustering.cpp 128 SmallVector<SDep, 4> Succs(SU.Succs);
129 for (SDep Succ : Succs)
GCNMinRegStrategy.cpp 88 for (auto SDep : SU->Succs) {
104 return SU->Succs.size() - getReadySuccessors(SU);
179 for (const auto &S : SchedSU->Succs) {
214 for (const auto &S : SU->Succs) {
AMDGPUSubtarget.cpp 872 SmallVector<const SUnit*, 64> Succs({Succ}), Preds({Pred});
874 for (unsigned I = 0; I < Succs.size(); ++I) {
875 for (const SDep &SI : Succs[I]->Succs) {
877 if (SU != Succs[I] && !llvm::is_contained(Succs, SU))
878 Succs.push_back(SU);
885 if (llvm::is_contained(Succs, SU))
914 for (SDep &SI : From->Succs) {
920 for (SDep &SI : SU->Succs) {
    [all...]
SIMachineScheduler.cpp 424 for (SDep& Succ : SU->Succs) {
465 for (SDep& Succ : SU->Succs) {
497 for (SDep& Succ : SU->Succs) {
528 assert(none_of(Succs,
541 for (std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind> &S : Succs) {
551 Succs.push_back(std::make_pair(Succ, Kind));
572 for (std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind> S : Succs) {
843 for (SDep& SuccDep : SU->Succs) {
927 for (SDep& SuccDep : SU->Succs) {
997 for (SDep& SuccDep : SU->Succs) {
    [all...]
SIMachineScheduler.h 98 std::vector<std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind>> Succs;
122 getSuccs() const { return Succs; }
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonHazardRecognizer.cpp 143 for (auto &S : SU->Succs)
158 for (auto &S : SU->Succs)
HexagonSubtarget.cpp 222 for (SDep &SI : SU.Succs) {
419 MachineInstr *DDst = Dst->Succs[0].getSUnit()->getInstr();
491 for (auto &I : Src->Succs) {
539 for (auto &I : Src->Succs) {
586 if (getZeroLatency(Dst, Dst->Succs) != nullptr)
595 DstBest = getZeroLatency(Src, Src->Succs);
642 for (auto &I : SrcBest->Succs)
HexagonMachineScheduler.cpp 70 if (SUd->Succs.size() == 0)
80 for (const auto &S : SUd->Succs) {
310 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
540 for (auto &Succ : SU->Succs) {
646 for (const SDep &SI : SU->Succs)
715 for (const SDep &SI : SU->Succs) {
740 for (const auto &SI : SU->Succs) {
836 CurrSize = (*I)->Succs.size();
837 CandSize = Candidate.SU->Succs.size()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
PruneEH.cpp 257 std::vector<BasicBlock *> Succs(succ_begin(BB), succ_end(BB));
259 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
260 Succs[i]->removePredecessor(BB);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ResourcePriorityQueue.cpp 111 for (const SDep &Succ : SU->Succs) {
148 for (const SDep &Succ : SU->Succs)
233 for (const SDep &Succ : SU->Succs)
272 for (const SDep &Succ : Packet[i]->Succs) {
517 for (const SDep &Succ : SU->Succs) {
534 HorizontalVerticalBalance += (SU->Succs.size() - numberCtrlDepsInSU(SU));
ScheduleDAGRRList.cpp 770 for (SDep &Succ : SU->Succs) {
886 for (auto &Succ : SU->Succs) {
900 for (auto &Succ2 : SU->Succs) {
1070 for (SDep &Succ : SU->Succs) {
1198 for (SDep &Succ : SU->Succs) {
1237 for (SDep &Succ : SU->Succs) {
1604 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
2270 if (PredSU->NumSuccsLeft != PredSU->Succs.size())
2332 for (const SDep &Succ : SU->Succs) {
2333 if (Succ.isCtrl()) continue; // ignore chain succs
    [all...]
ScheduleDAGVLIW.cpp 139 for (SDep &Succ : SU->Succs) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
TailDuplicator.h 114 SmallSetVector<MachineBasicBlock *, 8> &Succs);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
SCCPSolver.cpp 229 void getFeasibleSuccessors(Instruction &TI, SmallVectorImpl<bool> &Succs);
557 SmallVectorImpl<bool> &Succs) {
558 Succs.resize(TI.getNumSuccessors());
561 Succs[0] = true;
571 Succs[0] = Succs[1] = true;
576 Succs[CI->isZero()] = true;
582 Succs.assign(TI.getNumSuccessors(), true);
588 Succs[0] = true;
593 Succs[SI->findCaseValue(CI)->getSuccessorIndex()] = true
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlan.cpp 377 SmallVector<VPBlockBase *, 2> Succs(getSuccessors().begin(),
380 for (VPBlockBase *Succ : Succs)
388 for (VPBlockBase *Succ : Succs)
795 std::vector<BasicBlock *> Succs(succ_begin(BB), succ_end(BB));
796 assert(Succs.size() <= 2 &&
798 PostDomSucc = Succs[0];
799 if (Succs.size() == 1) {
805 BasicBlock *InterimSucc = Succs[1];
807 PostDomSucc = Succs[1];
808 InterimSucc = Succs[0]
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/
CFG.h 843 AdjacentBlocks Succs;
862 Succs(C, 1), HasNoReturnElement(false), Parent(parent) {}
955 succ_iterator succ_begin() { return Succs.begin(); }
956 succ_iterator succ_end() { return Succs.end(); }
957 const_succ_iterator succ_begin() const { return Succs.begin(); }
958 const_succ_iterator succ_end() const { return Succs.end(); }
960 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
961 succ_reverse_iterator succ_rend() { return Succs.rend(); }
962 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
963 const_succ_reverse_iterator succ_rend() const { return Succs.rend();
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 208 V->Succs.addNode(this, G);
526 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end();

Completed in 75 milliseconds

1 2