Home
last modified time | relevance | path

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

12

/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.cpp76 for (SmallVector<SDep, 4>::iterator II = PredSU->Succs.begin(), in addPred()
77 EE = PredSU->Succs.end(); II != EE; ++II) { in addPred()
108 N->Succs.push_back(P); in addPred()
129 for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(), in removePred()
130 EE = N->Succs.end(); II != EE; ++II) in removePred()
133 N->Succs.erase(II); in removePred()
169 for (SUnit::const_succ_iterator I = SU->Succs.begin(), in setDepthDirty()
170 E = SU->Succs.end(); I != E; ++I) { in setDepthDirty()
259 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), in ComputeHeight()
260 E = Cur->Succs.end(); I != E; ++I) { in ComputeHeight()
[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.cpp100 SmallSetVector<MachineBasicBlock*, 8> &Succs);
201 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(), in TailDuplicateAndUpdate() local
219 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); in TailDuplicateAndUpdate()
456 SmallSetVector<MachineBasicBlock*,8> &Succs) { in UpdateSuccessorsPHIs() argument
457 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(), in UpdateSuccessorsPHIs()
458 SE = Succs.end(); SI != SE; ++SI) { in UpdateSuccessorsPHIs()
643 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end()); in canCompletelyDuplicateBB() local
668 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(), in duplicateSimpleBB() local
680 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
DMachineSink.cpp540 SmallVector<MachineBasicBlock*, 4> Succs(MBB->succ_begin(), MBB->succ_end()); in FindSuccToSinkTo() local
541 std::stable_sort(Succs.begin(), Succs.end(), SuccessorSorter(LI)); in FindSuccToSinkTo()
542 for (SmallVector<MachineBasicBlock*, 4>::iterator SI = Succs.begin(), in FindSuccToSinkTo()
543 E = Succs.end(); SI != E; ++SI) { in FindSuccToSinkTo()
DMachineScheduler.cpp457 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
600 if (I->Succs.empty()) in releaseRoots()
926 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseBottomNode()
DScheduleDAGInstrs.cpp645 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end(); in iterateChainSucc()
676 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(), in adjustChainDeps()
677 JE = (*I)->Succs.end(); J != JE; ++J) in adjustChainDeps()
DIfConversion.cpp1516 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in CopyAndPredicateBlock() local
1521 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in CopyAndPredicateBlock()
1522 MachineBasicBlock *Succ = Succs[i]; in CopyAndPredicateBlock()
1549 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in MergeBlocks() local
1554 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in MergeBlocks()
1555 MachineBasicBlock *Succ = Succs[i]; in MergeBlocks()
/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.h121 NodeGroup Succs; variable
127 : Location(loc), State(state), Succs(IsSink) { in ExplodedNode()
177 unsigned succ_size() const { return Succs.size(); } in succ_size()
179 bool succ_empty() const { return Succs.empty(); } in succ_empty()
182 bool isSink() const { return Succs.getFlag(); } in isSink()
212 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
213 succ_iterator succ_end() { return Succs.end(); } in succ_end()
235 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()
525 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
DScheduleDAGRRList.cpp720 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
827 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in UnscheduleNodeBottomUp()
1010 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1088 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1128 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
1456 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
2100 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()
2162 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in closestSucc()
2216 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in hasOnlyLiveOutUses()
2686 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()
/external/clang/include/clang/Analysis/
DCFG.h335 AdjacentBlocks Succs; variable
354 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
403 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
404 succ_iterator succ_end() { return Succs.end(); } in succ_end()
405 const_succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
406 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end()
408 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } in succ_rbegin()
409 succ_reverse_iterator succ_rend() { return Succs.rend(); } in succ_rend()
410 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } in succ_rbegin()
411 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); } in succ_rend()
[all …]
/external/llvm/lib/Transforms/Scalar/
DLoopUnswitch.cpp1018 SmallVector<BasicBlock*, 4> Succs; in RemoveBlockIfDead() local
1020 Succs.push_back(TI->getSuccessor(i)); in RemoveBlockIfDead()
1025 array_pod_sort(Succs.begin(), Succs.end()); in RemoveBlockIfDead()
1026 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end()); in RemoveBlockIfDead()
1035 for (unsigned i = 0; i != Succs.size(); ++i) in RemoveBlockIfDead()
1036 if (pred_begin(Succs[i]) != pred_end(Succs[i])) { in RemoveBlockIfDead()
1042 if (!LI->isLoopHeader(Succs[i])) { in RemoveBlockIfDead()
1043 Succs.erase(Succs.begin()+i); in RemoveBlockIfDead()
1048 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in RemoveBlockIfDead()
1049 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/Target/Hexagon/
DHexagonMachineScheduler.cpp82 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
248 if (Packet[i]->Succs.size() == 0) in isResourceAvailable()
250 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(), in isResourceAvailable()
251 E = Packet[i]->Succs.end(); I != E; ++I) { in isResourceAvailable()
325 if (I->Succs.empty()) in releaseRoots()
503 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseBottomNode()
701 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in getSingleUnscheduledSucc()
764 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in SchedulingCost()
DHexagonVLIWPacketizer.cpp3068 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in RestrictingDepExistInPacket()
3069 if ((PacketSU->Succs[i].getSUnit() == PacketSUDep) && in RestrictingDepExistInPacket()
3070 (PacketSU->Succs[i].getKind() == SDep::Anti) && in RestrictingDepExistInPacket()
3071 (PacketSU->Succs[i].getReg() == DepReg)) { in RestrictingDepExistInPacket()
3123 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in ArePredicatesComplements()
3129 if (PacketSU->Succs[i].getSUnit() == SU && in ArePredicatesComplements()
3131 PacketSU->Succs[i].getReg()) && in ArePredicatesComplements()
3132 PacketSU->Succs[i].getKind() == SDep::Data && in ArePredicatesComplements()
3139 RestrictingDepExistInPacket(*VIN,PacketSU->Succs[i].getReg(), in ArePredicatesComplements()
3362 (i < SUJ->Succs.size()) && !FoundSequentialDependence; in isLegalToPacketizeTogether()
[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);
535 const UniqueVector<BasicBlock *> &Succs) { in buildEdgeLookupTable() argument
543 Int64PtrTy, Succs.size() * Preds.size()); in buildEdgeLookupTable()
545 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()]; in buildEdgeLookupTable()
547 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i) in buildEdgeLookupTable()
560 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + in buildEdgeLookupTable()
567 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size()); in buildEdgeLookupTable()
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp184 V->Succs.addNode(this, G); in addPredecessor()
410 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end(); in TrimInternal()
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h259 SmallVector<SDep, 4> Succs; // All sunit successors.
430 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
431 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.cpp751 std::vector<BasicBlock*> Succs(succ_begin(codeReplacer), in extractCodeRegion() local
753 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in extractCodeRegion()
754 for (BasicBlock::iterator I = Succs[i]->begin(); isa<PHINode>(I); ++I) { in extractCodeRegion()

12