Home
last modified time | relevance | path

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

12

/freebsd-9-stable/contrib/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 …]
/freebsd-9-stable/contrib/llvm/lib/CodeGen/
DScheduleDAG.cpp80 for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(), in addPred()
81 EE = PredSU->Succs.end(); II != EE; ++II) { in addPred()
122 N->Succs.push_back(P); in addPred()
142 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(), in removePred()
143 N->Succs.end(), P); in removePred()
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!"); in removePred()
145 N->Succs.erase(Succ); in removePred()
185 for (SUnit::const_succ_iterator I = SU->Succs.begin(), in setDepthDirty()
186 E = SU->Succs.end(); I != E; ++I) { in setDepthDirty()
275 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), 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()
DMachineSink.cpp555 SmallVector<MachineBasicBlock*, 4> Succs(MBB->succ_begin(), MBB->succ_end()); in FindSuccToSinkTo() local
556 std::stable_sort(Succs.begin(), Succs.end(), SuccessorSorter(LI)); in FindSuccToSinkTo()
557 for (SmallVectorImpl<MachineBasicBlock *>::iterator SI = Succs.begin(), in FindSuccToSinkTo()
558 E = Succs.end(); SI != E; ++SI) { in FindSuccToSinkTo()
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()
454 SmallSetVector<MachineBasicBlock*,8> &Succs) { in UpdateSuccessorsPHIs() argument
455 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(), in UpdateSuccessorsPHIs()
456 SE = Succs.end(); SI != SE; ++SI) { in UpdateSuccessorsPHIs()
664 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(), in duplicateSimpleBB() local
676 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
DScheduleDAGInstrs.cpp598 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end(); in iterateChainSucc()
629 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(), in adjustChainDeps()
630 JE = (*I)->Succs.end(); J != JE; ++J) in adjustChainDeps()
1187 for (SUnit::const_succ_iterator SI = PredSU->Succs.begin(), in joinPredSubtree()
1188 SE = PredSU->Succs.end(); SI != SE; ++SI) { in joinPredSubtree()
1252 SI = SU->Succs.begin(), SE = SU->Succs.end(); SI != SE; ++SI) { in hasDataSucc()
DMachineScheduler.cpp416 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
1048 SI = SUa->Succs.begin(), SE = SUa->Succs.end(); SI != SE; ++SI) { in clusterNeighboringLoads()
1260 I = LastLocalSU->Succs.begin(), E = LastLocalSU->Succs.end(); in constrainLocalCopy()
1803 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseBottomNode()
2791 SmallVectorImpl<SDep> &Deps = isTop ? SU->Preds : SU->Succs; in reschedulePhysRegCopies()
2800 if (isTop ? DepSU->Succs.size() > 1 : DepSU->Preds.size() > 1) in reschedulePhysRegCopies()
3075 return (Node->Preds.size() > 10 || Node->Succs.size() > 10); in isNodeHidden()
DIfConversion.cpp1563 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in CopyAndPredicateBlock() local
1568 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in CopyAndPredicateBlock()
1569 MachineBasicBlock *Succ = Succs[i]; in CopyAndPredicateBlock()
1599 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), in MergeBlocks() local
1604 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { in MergeBlocks()
1605 MachineBasicBlock *Succ = Succs[i]; in MergeBlocks()
/freebsd-9-stable/contrib/llvm/tools/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()
/freebsd-9-stable/contrib/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()
526 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in scheduledNode()
544 HorizontalVerticalBalance += (SU->Succs.size() - numberCtrlDepsInSU(SU)); in scheduledNode()
DScheduleDAGFast.cpp193 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
295 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
365 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
402 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
535 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
DScheduleDAGRRList.cpp739 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in ScheduleNodeBottomUp()
850 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in UnscheduleNodeBottomUp()
1030 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1110 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in CopyAndMoveSuccessors()
1150 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in InsertCopiesAndMoveSuccs()
1488 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
2132 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()
2194 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in closestSucc()
2248 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in hasOnlyLiveOutUses()
2719 for (SUnit::const_succ_iterator SI = SU->Succs.begin(), SE = SU->Succs.end(); in canClobberReachingPhysRegUse()
[all …]
DScheduleDAGVLIW.cpp141 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
/freebsd-9-stable/contrib/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()
243 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseBottomNode()
443 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in getSingleUnscheduledSucc()
504 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in SchedulingCost()
DHexagonVLIWPacketizer.cpp826 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in RestrictingDepExistInPacket()
827 if ((PacketSU->Succs[i].getSUnit() == PacketSUDep) && in RestrictingDepExistInPacket()
828 (PacketSU->Succs[i].getKind() == SDep::Anti) && in RestrictingDepExistInPacket()
829 (PacketSU->Succs[i].getReg() == DepReg)) { in RestrictingDepExistInPacket()
904 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in ArePredicatesComplements()
910 if (PacketSU->Succs[i].getSUnit() == SU && in ArePredicatesComplements()
911 PacketSU->Succs[i].getKind() == SDep::Data && in ArePredicatesComplements()
913 PacketSU->Succs[i].getReg()) && in ArePredicatesComplements()
920 RestrictingDepExistInPacket(*VIN,PacketSU->Succs[i].getReg(), in ArePredicatesComplements()
1143 (i < SUJ->Succs.size()) && !FoundSequentialDependence; in isLegalToPacketizeTogether()
[all …]
/freebsd-9-stable/contrib/llvm/tools/clang/include/clang/Analysis/
DCFG.h395 AdjacentBlocks Succs; variable
414 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), in CFGBlock()
463 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
464 succ_iterator succ_end() { return Succs.end(); } in succ_end()
465 const_succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
466 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end()
468 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } in succ_rbegin()
469 succ_reverse_iterator succ_rend() { return Succs.rend(); } in succ_rend()
470 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } in succ_rbegin()
471 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); } in succ_rend()
[all …]
/freebsd-9-stable/contrib/llvm/lib/Transforms/IPO/
DPruneEH.cpp252 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB)); in DeleteBasicBlock() local
254 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in DeleteBasicBlock()
255 Succs[i]->removePredecessor(BB); in DeleteBasicBlock()
/freebsd-9-stable/contrib/llvm/lib/Transforms/Scalar/
DSCCP.cpp442 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs);
516 SmallVectorImpl<bool> &Succs) { in getFeasibleSuccessors() argument
517 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
520 Succs[0] = true; in getFeasibleSuccessors()
530 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
535 Succs[CI->isZero()] = true; in getFeasibleSuccessors()
541 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
547 Succs[0] = true; in getFeasibleSuccessors()
556 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
560 Succs[SI->findCaseValue(CI).getSuccessorIndex()] = true; in getFeasibleSuccessors()
[all …]
/freebsd-9-stable/contrib/llvm/lib/MC/
DMCObjectDisassembler.cpp163 BBInfoSetTy Succs; member
170 Succs.insert(&Succ); in addSucc()
281 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end(); in buildCFG()
295 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end(); in buildCFG()
DMCModuleYAML.cpp110 std::vector<yaml::Hex64> Succs; member
200 IO.mapRequired("Succs", BB.Succs); in mapping()
348 BB.Succs.push_back((*SI)->getInsts()->getBeginAddr()); in dumpFunction()
424 for (AddrIt SI = BBI->Succs.begin(), SE = BBI->Succs.end(); SI != SE; in parse()
/freebsd-9-stable/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp216 V->Succs.addNode(this, G); in addPredecessor()
426 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end(); in trim()
/freebsd-9-stable/contrib/llvm/include/llvm/CodeGen/
DScheduleDAG.h264 SmallVector<SDep, 4> Succs; // All sunit successors.
447 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
448 if (Succs[i].getSUnit() == N)
/freebsd-9-stable/contrib/llvm/lib/Target/R600/
DR600Packetizer.cpp197 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) { in isLegalToPacketizeTogether()
198 const SDep &Dep = SUJ->Succs[i]; in isLegalToPacketizeTogether()
/freebsd-9-stable/contrib/llvm/include/llvm/Analysis/
DSparsePropagation.h195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
/freebsd-9-stable/contrib/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp119 const UniqueVector<BasicBlock*>&Succs);
623 const UniqueVector<BasicBlock *> &Succs) { in buildEdgeLookupTable() argument
629 size_t TableSize = Succs.size() * Preds.size(); in buildEdgeLookupTable()
648 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + in buildEdgeLookupTable()

12