Home
last modified time | relevance | path

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

12

/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/llvm/lib/CodeGen/
DScheduleDAG.cpp81 for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(), in addPred()
82 EE = PredSU->Succs.end(); II != EE; ++II) { in addPred()
123 N->Succs.push_back(P); in addPred()
143 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(), in removePred()
144 N->Succs.end(), P); in removePred()
145 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!"); in removePred()
146 N->Succs.erase(Succ); in removePred()
186 for (SUnit::const_succ_iterator I = SU->Succs.begin(), in setDepthDirty()
187 E = SU->Succs.end(); I != E; ++I) { in setDepthDirty()
276 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()
DMachineSink.cpp544 SmallVector<MachineBasicBlock*, 4> Succs(MBB->succ_begin(), MBB->succ_end()); in FindSuccToSinkTo() local
547 Succs.begin(), Succs.end(), in FindSuccToSinkTo()
551 for (SmallVectorImpl<MachineBasicBlock *>::iterator SI = Succs.begin(), in FindSuccToSinkTo()
552 E = Succs.end(); SI != E; ++SI) { in FindSuccToSinkTo()
DTailDuplication.cpp104 SmallSetVector<MachineBasicBlock*, 8> &Succs);
215 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(), in TailDuplicateAndUpdate() local
233 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); in TailDuplicateAndUpdate()
464 SmallSetVector<MachineBasicBlock*,8> &Succs) { in UpdateSuccessorsPHIs() argument
465 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(), in UpdateSuccessorsPHIs()
466 SE = Succs.end(); SI != SE; ++SI) { in UpdateSuccessorsPHIs()
674 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(), in duplicateSimpleBB() local
686 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
DScheduleDAGInstrs.cpp610 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end(); in iterateChainSucc()
641 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(), in adjustChainDeps()
642 JE = (*I)->Succs.end(); J != JE; ++J) in adjustChainDeps()
1378 for (SUnit::const_succ_iterator SI = PredSU->Succs.begin(), in joinPredSubtree()
1379 SE = PredSU->Succs.end(); SI != SE; ++SI) { in joinPredSubtree()
1443 SI = SU->Succs.begin(), SE = SU->Succs.end(); SI != SE; ++SI) { in hasDataSucc()
DPostRASchedulerList.cpp457 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ReleaseSuccessors()
DIfConversion.cpp1609 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in CopyAndPredicateBlock() local
1614 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in CopyAndPredicateBlock()
1615 MachineBasicBlock *Succ = Succs[i]; in CopyAndPredicateBlock()
1645 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in MergeBlocks() local
1650 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in MergeBlocks()
1651 MachineBasicBlock *Succ = Succs[i]; in MergeBlocks()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h121 NodeGroup Succs; variable
127 : Location(loc), State(state), Succs(IsSink) { in ExplodedNode()
180 unsigned succ_size() const { return Succs.size(); } in succ_size()
182 bool succ_empty() const { return Succs.empty(); } in succ_empty()
185 bool isSink() const { return Succs.getFlag(); } in isSink()
219 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
220 succ_iterator succ_end() { return Succs.end(); } in succ_end()
242 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); } in replaceSuccessor()
/external/llvm/lib/CodeGen/SelectionDAG/
DResourcePriorityQueue.cpp112 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in numberRCValSuccInSU()
149 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in numberCtrlDepsInSU()
237 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in push()
276 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(), in isResourceAvailable()
277 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.cpp194 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
296 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
366 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
403 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
536 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
DScheduleDAGRRList.cpp741 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
852 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in UnscheduleNodeBottomUp()
1032 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1112 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1152 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
1490 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
2126 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()
2188 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in closestSucc()
2242 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in hasOnlyLiveOutUses()
2713 for (SUnit::const_succ_iterator SI = SU->Succs.begin(), SE = SU->Succs.end(); in canClobberReachingPhysRegUse()
[all …]
DScheduleDAGVLIW.cpp143 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
/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()
246 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseBottomNode()
446 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in getSingleUnscheduledSucc()
507 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in SchedulingCost()
DHexagonVLIWPacketizer.cpp827 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in RestrictingDepExistInPacket()
828 if ((PacketSU->Succs[i].getSUnit() == PacketSUDep) && in RestrictingDepExistInPacket()
829 (PacketSU->Succs[i].getKind() == SDep::Anti) && in RestrictingDepExistInPacket()
830 (PacketSU->Succs[i].getReg() == DepReg)) { in RestrictingDepExistInPacket()
905 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in ArePredicatesComplements()
911 if (PacketSU->Succs[i].getSUnit() == SU && in ArePredicatesComplements()
912 PacketSU->Succs[i].getKind() == SDep::Data && in ArePredicatesComplements()
914 PacketSU->Succs[i].getReg()) && in ArePredicatesComplements()
921 RestrictingDepExistInPacket(*VIN,PacketSU->Succs[i].getReg(), in ArePredicatesComplements()
1144 (i < SUJ->Succs.size()) && !FoundSequentialDependence; in isLegalToPacketizeTogether()
[all …]
/external/clang/include/clang/Analysis/
DCFG.h475 AdjacentBlocks Succs; variable
494 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
543 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
544 succ_iterator succ_end() { return Succs.end(); } in succ_end()
545 const_succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
546 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end()
548 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } in succ_rbegin()
549 succ_reverse_iterator succ_rend() { return Succs.rend(); } in succ_rend()
550 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } in succ_rbegin()
551 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); } in succ_rend()
[all …]
/external/llvm/lib/Transforms/IPO/
DPruneEH.cpp253 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB)); in DeleteBasicBlock() local
255 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in DeleteBasicBlock()
256 Succs[i]->removePredecessor(BB); in DeleteBasicBlock()
/external/llvm/lib/MC/MCAnalysis/
DMCObjectDisassembler.cpp161 BBInfoSetTy Succs; member
168 Succs.insert(&Succ); in addSucc()
275 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end(); in buildCFG()
289 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end(); in buildCFG()
DMCModuleYAML.cpp111 std::vector<yaml::Hex64> Succs; member
203 IO.mapRequired("Succs", BB.Succs); in mapping()
351 BB.Succs.push_back((*SI)->getInsts()->getBeginAddr()); in dumpFunction()
427 for (AddrIt SI = BBI->Succs.begin(), SE = BBI->Succs.end(); SI != SE; in parse()
/external/llvm/lib/Transforms/Scalar/
DSCCP.cpp443 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs);
518 SmallVectorImpl<bool> &Succs) { in getFeasibleSuccessors() argument
519 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
522 Succs[0] = true; in getFeasibleSuccessors()
532 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
537 Succs[CI->isZero()] = true; in getFeasibleSuccessors()
543 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
549 Succs[0] = true; in getFeasibleSuccessors()
558 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
562 Succs[SI->findCaseValue(CI).getSuccessorIndex()] = true; in getFeasibleSuccessors()
[all …]
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp221 V->Succs.addNode(this, G); in addPredecessor()
432 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end(); in trim()
/external/llvm/include/llvm/CodeGen/
DScheduleDAG.h270 SmallVector<SDep, 4> Succs; // All sunit successors.
461 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
462 if (Succs[i].getSUnit() == N)
/external/llvm/lib/Target/R600/
DR600Packetizer.cpp200 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) { in isLegalToPacketizeTogether()
201 const SDep &Dep = SUJ->Succs[i]; in isLegalToPacketizeTogether()
/external/llvm/include/llvm/Analysis/
DSparsePropagation.h195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
/external/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp122 const UniqueVector<BasicBlock*>&Succs);
709 const UniqueVector<BasicBlock *> &Succs) { in buildEdgeLookupTable() argument
715 size_t TableSize = Succs.size() * Preds.size(); in buildEdgeLookupTable()
734 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + in buildEdgeLookupTable()

12