Home
last modified time | relevance | path

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

/external/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.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()
174 for (SUnit::const_succ_iterator I = SU->Succs.begin(), in setDepthDirty()
175 E = SU->Succs.end(); I != E; ++I) { in setDepthDirty()
264 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), in ComputeHeight()
265 E = Cur->Succs.end(); I != E; ++I) { in ComputeHeight()
325 if (Succs.size() != 0) { in dumpAll()
327 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()
DTailDuplication.cpp95 SmallSetVector<MachineBasicBlock*, 8> &Succs);
190 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(), in TailDuplicateAndUpdate() local
208 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); in TailDuplicateAndUpdate()
443 SmallSetVector<MachineBasicBlock*,8> &Succs) { in UpdateSuccessorsPHIs() argument
444 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(), in UpdateSuccessorsPHIs()
445 SE = Succs.end(); SI != SE; ++SI) { in UpdateSuccessorsPHIs()
631 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end()); in canCompletelyDuplicateBB() local
656 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(), in duplicateSimpleBB() local
668 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
DIfConversion.cpp1446 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in CopyAndPredicateBlock() local
1451 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in CopyAndPredicateBlock()
1452 MachineBasicBlock *Succ = Succs[i]; in CopyAndPredicateBlock()
1479 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in MergeBlocks() local
1484 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in MergeBlocks()
1485 MachineBasicBlock *Succ = Succs[i]; in MergeBlocks()
DPostRASchedulerList.cpp568 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ReleaseSuccessors()
DVirtRegRewriter.cpp461 SmallVectorImpl<MachineBasicBlock *> &Succs){ in findSinglePredSuccessor() argument
466 Succs.push_back(SuccMBB); in findSinglePredSuccessor()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h115 NodeGroup Succs; variable
164 unsigned succ_size() const { return Succs.size(); } in succ_size()
166 bool succ_empty() const { return Succs.empty(); } in succ_empty()
169 bool isSink() const { return Succs.getFlag(); } in isSink()
170 void markAsSink() { Succs.setFlag(); } in markAsSink()
196 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
197 succ_iterator succ_end() { return Succs.end(); } in succ_end()
219 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); } in replaceSuccessor()
/external/clang/include/clang/Analysis/
DCFG.h336 AdjacentBlocks Succs; variable
341 BlockID(blockid), Preds(C, 1), Succs(C, 1) {} in CFGBlock()
389 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
390 succ_iterator succ_end() { return Succs.end(); } in succ_end()
391 const_succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
392 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end()
394 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } in succ_rbegin()
395 succ_reverse_iterator succ_rend() { return Succs.rend(); } in succ_rend()
396 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } in succ_rbegin()
397 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); } in succ_rend()
[all …]
/external/llvm/lib/Transforms/Scalar/
DLoopUnswitch.cpp808 SmallVector<BasicBlock*, 4> Succs; in RemoveBlockIfDead() local
810 Succs.push_back(TI->getSuccessor(i)); in RemoveBlockIfDead()
815 array_pod_sort(Succs.begin(), Succs.end()); in RemoveBlockIfDead()
816 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end()); in RemoveBlockIfDead()
825 for (unsigned i = 0; i != Succs.size(); ++i) in RemoveBlockIfDead()
826 if (pred_begin(Succs[i]) != pred_end(Succs[i])) { in RemoveBlockIfDead()
832 if (!LI->isLoopHeader(Succs[i])) { in RemoveBlockIfDead()
833 Succs.erase(Succs.begin()+i); in RemoveBlockIfDead()
838 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in RemoveBlockIfDead()
839 RemoveBlockIfDead(Succs[i], Worklist, L); in RemoveBlockIfDead()
DSCCP.cpp454 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs);
550 SmallVector<bool, 16> &Succs) { in getFeasibleSuccessors() argument
551 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
554 Succs[0] = true; in getFeasibleSuccessors()
564 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
569 Succs[CI->isZero()] = true; in getFeasibleSuccessors()
575 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
586 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
590 Succs[SI->findCaseValue(CI)] = true; in getFeasibleSuccessors()
597 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
/external/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 …]
DScheduleDAGList.cpp131 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ReleaseSuccessors()
DSelectionDAGISel.cpp1156 SmallVector<MachineBasicBlock *, 2> Succs; in FinishBasicBlock() local
1157 Succs.push_back(SDB->SwitchCases[i].TrueBB); in FinishBasicBlock()
1159 Succs.push_back(SDB->SwitchCases[i].FalseBB); in FinishBasicBlock()
1175 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in FinishBasicBlock()
1176 FuncInfo->MBB = Succs[i]; in FinishBasicBlock()
/external/llvm/lib/Transforms/IPO/
DPruneEH.cpp250 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB)); in DeleteBasicBlock() local
252 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in DeleteBasicBlock()
253 Succs[i]->removePredecessor(BB); in DeleteBasicBlock()
/external/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp85 const UniqueVector<BasicBlock *> &Succs);
532 const UniqueVector<BasicBlock *> &Succs) { in buildEdgeLookupTable() argument
540 Int64PtrTy, Succs.size() * Preds.size()); in buildEdgeLookupTable()
542 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()]; in buildEdgeLookupTable()
544 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i) in buildEdgeLookupTable()
557 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + in buildEdgeLookupTable()
564 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size()); in buildEdgeLookupTable()
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp144 V->Succs.addNode(this, G); in addPredecessor()
365 for (ExplodedNode **I=N->Succs.begin(), **E=N->Succs.end(); I!=E; ++I) { in TrimInternal()
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h238 SmallVector<SDep, 4> Succs; // All sunit successors.
406 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
407 if (Succs[i].getSUnit() == N)
/external/llvm/include/llvm/Analysis/
DSparsePropagation.h195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
/external/llvm/lib/Transforms/Utils/
DCodeExtractor.cpp728 std::vector<BasicBlock*> Succs(succ_begin(codeReplacer), in ExtractCodeRegion() local
730 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in ExtractCodeRegion()
731 for (BasicBlock::iterator I = Succs[i]->begin(); isa<PHINode>(I); ++I) { in ExtractCodeRegion()
DSimplifyCFG.cpp2569 SmallPtrSet<Value *, 8> Succs; in SimplifyIndirectBr() local
2572 if (!Dest->hasAddressTaken() || !Succs.insert(Dest)) { in SimplifyIndirectBr()