Home
last modified time | relevance | path

Searched refs:Succs (Results 1 – 25 of 25) 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.cpp91 N->Succs.push_back(P); in addPred()
112 for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(), in removePred()
113 EE = N->Succs.end(); II != EE; ++II) in removePred()
116 N->Succs.erase(II); in removePred()
152 for (SUnit::const_succ_iterator I = SU->Succs.begin(), in setDepthDirty()
153 E = SU->Succs.end(); I != E; ++I) { in setDepthDirty()
242 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), in ComputeHeight()
243 E = Cur->Succs.end(); I != E; ++I) { in ComputeHeight()
302 if (Succs.size() != 0) { in dumpAll()
304 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()
DTailDuplication.cpp95 SmallSetVector<MachineBasicBlock*, 8> &Succs);
192 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(), in TailDuplicateAndUpdate() local
210 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); in TailDuplicateAndUpdate()
445 SmallSetVector<MachineBasicBlock*,8> &Succs) { in UpdateSuccessorsPHIs() argument
446 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(), in UpdateSuccessorsPHIs()
447 SE = Succs.end(); SI != SE; ++SI) { in UpdateSuccessorsPHIs()
632 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end()); in canCompletelyDuplicateBB() local
657 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(), in duplicateSimpleBB() local
669 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
DMachineScheduler.cpp340 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
419 if (I->Succs.empty()) in schedule()
DIfConversion.cpp1509 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in CopyAndPredicateBlock() local
1514 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in CopyAndPredicateBlock()
1515 MachineBasicBlock *Succ = Succs[i]; in CopyAndPredicateBlock()
1542 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in MergeBlocks() local
1547 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in MergeBlocks()
1548 MachineBasicBlock *Succ = Succs[i]; in MergeBlocks()
DPostRASchedulerList.cpp618 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ReleaseSuccessors()
/external/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/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h116 NodeGroup Succs; variable
124 Succs.setFlag(); in ExplodedNode()
169 unsigned succ_size() const { return Succs.size(); } in succ_size()
171 bool succ_empty() const { return Succs.empty(); } in succ_empty()
174 bool isSink() const { return Succs.getFlag(); } in isSink()
204 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
205 succ_iterator succ_end() { return Succs.end(); } in succ_end()
227 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); } in replaceSuccessor()
/external/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp111 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in numberRCValSuccInSU()
148 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in numberCtrlDepsInSU()
236 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in push()
275 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(), in isResourceAvailable()
276 E = Packet[i]->Succs.end(); I != E; ++I) { in isResourceAvailable()
527 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in scheduledNode()
545 HorizontalVerticalBalance += (SU->Succs.size() - numberCtrlDepsInSU(SU)); in scheduledNode()
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.cpp717 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
824 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in UnscheduleNodeBottomUp()
1007 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1085 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1125 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
1453 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
2093 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()
2155 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in closestSucc()
2209 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in hasOnlyLiveOutUses()
2680 for (SUnit::const_succ_iterator SI = SU->Succs.begin(), SE = SU->Succs.end(); in canClobberReachingPhysRegUse()
[all …]
DScheduleDAGVLIW.cpp139 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
DScheduleDAGSDNodes.cpp733 for (SUnit::const_succ_iterator II = SU->Succs.begin(), in EmitPhysRegCopy()
734 EE = SU->Succs.end(); II != EE; ++II) { in EmitPhysRegCopy()
DSelectionDAGISel.cpp1326 SmallVector<MachineBasicBlock *, 2> Succs; in FinishBasicBlock() local
1327 Succs.push_back(SDB->SwitchCases[i].TrueBB); in FinishBasicBlock()
1329 Succs.push_back(SDB->SwitchCases[i].FalseBB); in FinishBasicBlock()
1345 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in FinishBasicBlock()
1346 FuncInfo->MBB = Succs[i]; in FinishBasicBlock()
/external/clang/include/clang/Analysis/
DCFG.h334 AdjacentBlocks Succs; variable
353 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
402 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
403 succ_iterator succ_end() { return Succs.end(); } in succ_end()
404 const_succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
405 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end()
407 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } in succ_rbegin()
408 succ_reverse_iterator succ_rend() { return Succs.rend(); } in succ_rend()
409 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } in succ_rbegin()
410 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); } in succ_rend()
[all …]
/external/llvm/lib/Transforms/Scalar/
DLoopUnswitch.cpp1028 SmallVector<BasicBlock*, 4> Succs; in RemoveBlockIfDead() local
1030 Succs.push_back(TI->getSuccessor(i)); in RemoveBlockIfDead()
1035 array_pod_sort(Succs.begin(), Succs.end()); in RemoveBlockIfDead()
1036 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end()); in RemoveBlockIfDead()
1045 for (unsigned i = 0; i != Succs.size(); ++i) in RemoveBlockIfDead()
1046 if (pred_begin(Succs[i]) != pred_end(Succs[i])) { in RemoveBlockIfDead()
1052 if (!LI->isLoopHeader(Succs[i])) { in RemoveBlockIfDead()
1053 Succs.erase(Succs.begin()+i); in RemoveBlockIfDead()
1058 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in RemoveBlockIfDead()
1059 RemoveBlockIfDead(Succs[i], Worklist, L); in RemoveBlockIfDead()
DSCCP.cpp449 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs);
523 SmallVector<bool, 16> &Succs) { in getFeasibleSuccessors() argument
524 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
527 Succs[0] = true; in getFeasibleSuccessors()
537 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
542 Succs[CI->isZero()] = true; in getFeasibleSuccessors()
548 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
554 Succs[0] = true; in getFeasibleSuccessors()
563 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
567 Succs[SI->findCaseValue(CI).getSuccessorIndex()] = true; in getFeasibleSuccessors()
[all …]
/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.cpp87 const UniqueVector<BasicBlock *> &Succs);
528 const UniqueVector<BasicBlock *> &Succs) { in buildEdgeLookupTable() argument
536 Int64PtrTy, Succs.size() * Preds.size()); in buildEdgeLookupTable()
538 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()]; in buildEdgeLookupTable()
540 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i) in buildEdgeLookupTable()
553 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + in buildEdgeLookupTable()
560 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size()); in buildEdgeLookupTable()
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp162 V->Succs.addNode(this, G); in addPredecessor()
380 for (ExplodedNode **I=N->Succs.begin(), **E=N->Succs.end(); I!=E; ++I) { in TrimInternal()
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h239 SmallVector<SDep, 4> Succs; // All sunit successors.
407 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
408 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.cpp2709 SmallPtrSet<Value *, 8> Succs; in SimplifyIndirectBr() local
2712 if (!Dest->hasAddressTaken() || !Succs.insert(Dest)) { in SimplifyIndirectBr()