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

12

/freebsd-10.2-release/contrib/llvm/lib/Analysis/
H A DSparsePropagation.cpp121 SmallVectorImpl<bool> &Succs,
123 Succs.resize(TI.getNumSuccessors());
128 Succs[0] = true;
141 Succs[0] = Succs[1] = true;
152 Succs[0] = Succs[1] = true;
157 Succs[C->isNullValue()] = true;
164 Succs[0] = Succs[
120 getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) argument
[all...]
/freebsd-10.2-release/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp80 for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(),
81 EE = PredSU->Succs.end(); II != EE; ++II) {
122 N->Succs.push_back(P);
142 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(),
143 N->Succs.end(), P);
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
145 N->Succs.erase(Succ);
185 for (SUnit::const_succ_iterator I = SU->Succs.begin(),
186 E = SU->Succs.end(); I != E; ++I) {
275 for (SUnit::const_succ_iterator I = Cur->Succs
[all...]
H A DLatencyPriorityQueue.cpp76 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
92 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
H A DTailDuplication.cpp100 SmallSetVector<MachineBasicBlock*, 8> &Succs);
201 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(),
219 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs);
454 SmallSetVector<MachineBasicBlock*,8> &Succs) {
455 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(),
456 SE = Succs.end(); SI != SE; ++SI) {
664 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(),
676 if (bothUsedInPHI(*PredBB, Succs))
452 UpdateSuccessorsPHIs(MachineBasicBlock *FromBB, bool isDead, SmallVectorImpl<MachineBasicBlock *> &TDBBs, SmallSetVector<MachineBasicBlock*,8> &Succs) argument
H A DMachineSink.cpp555 SmallVector<MachineBasicBlock*, 4> Succs(MBB->succ_begin(), MBB->succ_end());
556 std::stable_sort(Succs.begin(), Succs.end(), SuccessorSorter(LI));
557 for (SmallVectorImpl<MachineBasicBlock *>::iterator SI = Succs.begin(),
558 E = Succs.end(); SI != E; ++SI) {
H A DScheduleDAGInstrs.cpp598 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end();
629 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(),
630 JE = (*I)->Succs.end(); J != JE; ++J)
1187 for (SUnit::const_succ_iterator SI = PredSU->Succs.begin(),
1188 SE = PredSU->Succs.end(); SI != SE; ++SI) {
1252 SI = SU->Succs.begin(), SE = SU->Succs.end(); SI != SE; ++SI) {
H A DMachineScheduler.cpp416 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1048 SI = SUa->Succs.begin(), SE = SUa->Succs.end(); SI != SE; ++SI) {
1260 I = LastLocalSU->Succs.begin(), E = LastLocalSU->Succs.end();
1803 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2791 SmallVectorImpl<SDep> &Deps = isTop ? SU->Preds : SU->Succs;
2800 if (isTop ? DepSU->Succs
[all...]
H A DIfConversion.cpp1563 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(),
1568 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
1569 MachineBasicBlock *Succ = Succs[i];
1599 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(),
1604 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
1605 MachineBasicBlock *Succ = Succs[i];
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h120 /// Succs - The successors of this node.
121 NodeGroup Succs; member in class:clang::ento::ExplodedNode
127 : Location(loc), State(state), Succs(IsSink) {
180 unsigned succ_size() const { return Succs.size(); }
182 bool succ_empty() const { return Succs.empty(); }
185 bool isSink() const { return Succs.getFlag(); }
219 succ_iterator succ_begin() { return Succs.begin(); }
220 succ_iterator succ_end() { return Succs.end(); }
242 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); }
/freebsd-10.2-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp111 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
148 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
236 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
275 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(),
276 E = Packet[i]->Succs.end(); I != E; ++I) {
526 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs
[all...]
H A DScheduleDAGVLIW.cpp141 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
H A DScheduleDAGFast.cpp193 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
295 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
365 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
402 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
535 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
H A DScheduleDAGRRList.cpp739 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
850 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1030 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1110 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1150 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs
[all...]
/freebsd-10.2-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonVLIWPacketizer.cpp826 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) {
827 if ((PacketSU->Succs[i].getSUnit() == PacketSUDep) &&
828 (PacketSU->Succs[i].getKind() == SDep::Anti) &&
829 (PacketSU->Succs[i].getReg() == DepReg)) {
904 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) {
910 if (PacketSU->Succs[i].getSUnit() == SU &&
911 PacketSU->Succs[i].getKind() == SDep::Data &&
913 PacketSU->Succs[i].getReg()) &&
920 RestrictingDepExistInPacket(*VIN,PacketSU->Succs[i].getReg(),
1143 (i < SUJ->Succs
[all...]
H A DHexagonMachineScheduler.cpp66 if (Packet[i]->Succs.size() == 0)
68 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(),
69 E = Packet[i]->Succs.end(); I != E; ++I) {
243 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
443 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
504 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
/freebsd-10.2-release/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCFG.h395 AdjacentBlocks Succs;
414 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
463 succ_iterator succ_begin() { return Succs.begin(); }
464 succ_iterator succ_end() { return Succs.end(); }
465 const_succ_iterator succ_begin() const { return Succs.begin(); }
466 const_succ_iterator succ_end() const { return Succs.end(); }
468 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
469 succ_reverse_iterator succ_rend() { return Succs.rend(); }
470 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
471 const_succ_reverse_iterator succ_rend() const { return Succs
[all...]
/freebsd-10.2-release/contrib/llvm/lib/Transforms/IPO/
H A DPruneEH.cpp252 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
254 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
255 Succs[i]->removePredecessor(BB);
/freebsd-10.2-release/contrib/llvm/lib/MC/
H A DMCObjectDisassembler.cpp163 BBInfoSetTy Succs; member in struct:__anon2399::BBInfo
170 Succs.insert(&Succ);
281 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end();
295 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end();
H A DMCModuleYAML.cpp110 std::vector<yaml::Hex64> Succs; member in struct:llvm::MCModuleYAML::BasicBlock
200 IO.mapRequired("Succs", BB.Succs);
348 BB.Succs.push_back((*SI)->getInsts()->getBeginAddr());
424 for (AddrIt SI = BBI->Succs.begin(), SE = BBI->Succs.end(); SI != SE;
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp216 V->Succs.addNode(this, G);
426 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end();
/freebsd-10.2-release/contrib/llvm/lib/Transforms/Scalar/
H A DSCCP.cpp442 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs);
516 SmallVectorImpl<bool> &Succs) {
517 Succs.resize(TI.getNumSuccessors());
520 Succs[0] = true;
530 Succs[0] = Succs[1] = true;
535 Succs[CI->isZero()] = true;
541 Succs[0] = Succs[1] = true;
547 Succs[
515 getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs) argument
[all...]
/freebsd-10.2-release/contrib/llvm/include/llvm/Analysis/
H A DSparsePropagation.h195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
/freebsd-10.2-release/contrib/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h262 // Preds/Succs - The SUnits before/after us in the graph.
264 SmallVector<SDep, 4> Succs; // All sunit successors. local
447 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
448 if (Succs[i].getSUnit() == N)
/freebsd-10.2-release/contrib/llvm/lib/Target/R600/
H A DR600Packetizer.cpp197 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) {
198 const SDep &Dep = SUJ->Succs[i];
/freebsd-10.2-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp119 const UniqueVector<BasicBlock*>&Succs);
623 const UniqueVector<BasicBlock *> &Succs) {
629 size_t TableSize = Succs.size() * Preds.size();
648 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
619 buildEdgeLookupTable( Function *F, GlobalVariable *Counters, const UniqueVector<BasicBlock *> &Preds, const UniqueVector<BasicBlock *> &Succs) argument

Completed in 150 milliseconds

12