/macosx-10.10/llvmCore-3425.0.34/tools/llvm-objdump/ |
H A D | MCFunction.h | 51 SetTy Succs; member in class:llvm::MCBasicBlock 56 succ_iterator succ_begin() const { return Succs.begin(); } 57 succ_iterator succ_end() const { return Succs.end(); } 59 bool contains(uint64_t Addr) const { return Succs.count(Addr); } 62 void addSucc(uint64_t Addr) { Succs.insert(Addr); }
|
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/ |
H A D | SparsePropagation.cpp | 121 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...] |
/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 76 for (SmallVector<SDep, 4>::iterator II = PredSU->Succs.begin(), 77 EE = PredSU->Succs.end(); II != EE; ++II) { 108 N->Succs.push_back(P); 129 for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(), 130 EE = N->Succs.end(); II != EE; ++II) 133 N->Succs.erase(II); 169 for (SUnit::const_succ_iterator I = SU->Succs.begin(), 170 E = SU->Succs.end(); I != E; ++I) { 259 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), 260 E = Cur->Succs [all...] |
H A D | LatencyPriorityQueue.cpp | 76 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 D | TailDuplication.cpp | 100 SmallSetVector<MachineBasicBlock*, 8> &Succs); 201 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(), 219 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); 456 SmallSetVector<MachineBasicBlock*,8> &Succs) { 457 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(), 458 SE = Succs.end(); SI != SE; ++SI) { 643 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end()); 668 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(), 680 if (bothUsedInPHI(*PredBB, Succs)) 454 UpdateSuccessorsPHIs(MachineBasicBlock *FromBB, bool isDead, SmallVector<MachineBasicBlock*, 8> &TDBBs, SmallSetVector<MachineBasicBlock*,8> &Succs) argument
|
H A D | MachineSink.cpp | 540 SmallVector<MachineBasicBlock*, 4> Succs(MBB->succ_begin(), MBB->succ_end()); 541 std::stable_sort(Succs.begin(), Succs.end(), SuccessorSorter(LI)); 542 for (SmallVector<MachineBasicBlock*, 4>::iterator SI = Succs.begin(), 543 E = Succs.end(); SI != E; ++SI) {
|
H A D | ScheduleDAGInstrs.cpp | 564 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end(); 595 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(), 596 JE = (*I)->Succs.end(); J != JE; ++J)
|
H A D | MachineScheduler.cpp | 319 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 526 if (I->Succs.empty()) 793 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
H A D | IfConversion.cpp | 1516 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), 1521 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { 1522 MachineBasicBlock *Succ = Succs[i]; 1549 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(), 1554 for (unsigned i = 0, e = Succs.size(); i != e; ++i) { 1555 MachineBasicBlock *Succ = Succs[i];
|
H A D | PostRASchedulerList.cpp | 616 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
H A D | MachineVerifier.cpp | 124 BlockSet Preds, Succs; member in struct:__anon10243::MachineVerifier::BBInfo 457 MInfo.Succs.insert(I->succ_begin(), I->succ_end()); 458 if (MInfo.Succs.size() != I->succ_size()) 511 if (!MBBInfoMap[*I].Succs.count(MBB)) {
|
/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/SelectionDAG/ |
H A D | ResourcePriorityQueue.cpp | 111 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) { 527 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs [all...] |
H A D | ScheduleDAGFast.cpp | 188 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 290 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 358 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 395 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 525 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
|
H A D | ScheduleDAGVLIW.cpp | 139 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
H A D | ScheduleDAGRRList.cpp | 720 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 827 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 1010 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 1088 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 1128 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs [all...] |
H A D | ScheduleDAGSDNodes.cpp | 769 for (SUnit::const_succ_iterator II = SU->Succs.begin(), 770 EE = SU->Succs.end(); II != EE; ++II) {
|
/macosx-10.10/llvmCore-3425.0.34/lib/Target/Hexagon/ |
H A D | HexagonMachineScheduler.cpp | 67 if (Packet[i]->Succs.size() == 0) 69 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(), 70 E = Packet[i]->Succs.end(); I != E; ++I) { 231 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 431 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 494 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
H A D | HexagonVLIWPacketizer.cpp | 3068 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { 3069 if ((PacketSU->Succs[i].getSUnit() == PacketSUDep) && 3070 (PacketSU->Succs[i].getKind() == SDep::Anti) && 3071 (PacketSU->Succs[i].getReg() == DepReg)) { 3123 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { 3129 if (PacketSU->Succs[i].getSUnit() == SU && 3131 PacketSU->Succs[i].getReg()) && 3132 PacketSU->Succs[i].getKind() == SDep::Data && 3139 RestrictingDepExistInPacket(*VIN,PacketSU->Succs[i].getReg(), 3362 (i < SUJ->Succs [all...] |
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Scalar/ |
H A D | LoopUnswitch.cpp | 1018 SmallVector<BasicBlock*, 4> Succs; local 1020 Succs.push_back(TI->getSuccessor(i)); 1025 array_pod_sort(Succs.begin(), Succs.end()); 1026 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end()); 1035 for (unsigned i = 0; i != Succs.size(); ++i) 1036 if (pred_begin(Succs[ [all...] |
H A D | SCCP.cpp | 449 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs); 523 SmallVector<bool, 16> &Succs) { 524 Succs.resize(TI.getNumSuccessors()); 527 Succs[0] = true; 537 Succs[0] = Succs[1] = true; 542 Succs[CI->isZero()] = true; 548 Succs[0] = Succs[1] = true; 554 Succs[ 522 getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs) argument [all...] |
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/IPO/ |
H A D | PruneEH.cpp | 250 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB)); 252 for (unsigned i = 0, e = Succs.size(); i != e; ++i) 253 Succs[i]->removePredecessor(BB);
|
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 87 const UniqueVector<BasicBlock *> &Succs); 537 const UniqueVector<BasicBlock *> &Succs) { 545 Int64PtrTy, Succs.size() * Preds.size()); 547 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()]; 549 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i) 562 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + 569 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size()); 533 buildEdgeLookupTable( Function *F, GlobalVariable *Counters, const UniqueVector<BasicBlock *> &Preds, const UniqueVector<BasicBlock *> &Succs) argument
|
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Analysis/ |
H A D | SparsePropagation.h | 195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
|
/macosx-10.10/llvmCore-3425.0.34/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 257 // Preds/Succs - The SUnits before/after us in the graph. 259 SmallVector<SDep, 4> Succs; // All sunit successors. member in class:llvm::SUnit 430 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i) 431 if (Succs[i].getSUnit() == N)
|
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 751 std::vector<BasicBlock*> Succs(succ_begin(codeReplacer), 753 for (unsigned i = 0, e = Succs.size(); i != e; ++i) 754 for (BasicBlock::iterator I = Succs[i]->begin(); isa<PHINode>(I); ++I) {
|