/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/ |
H A D | Interval.h | 52 : HeaderNode(I.HeaderNode), Nodes(I.Nodes), Successors(I.Successors) {} 60 /// Successors - List of BasicBlocks that are reachable directly from nodes in 64 std::vector<BasicBlock*> Successors; member in class:llvm::Interval 82 for (unsigned i = 0; i < Successors.size(); ++i) 83 if (Successors[i] == BB) return true; 86 //return find(Successors.begin(), Successors.end(), BB) != Successors.end(); 108 return I->Successors [all...] |
H A D | IntervalIterator.h | 202 Int->Successors.push_back(NodeHeader); 209 Int->Successors.push_back(NodeHeader); 221 Int->Successors.erase(std::remove(Int->Successors.begin(), 222 Int->Successors.end(), NodeHeader), 223 Int->Successors.end());
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/ |
H A D | Interval.cpp | 54 OS << "Interval Successors:\n"; 55 for (std::vector<BasicBlock*>::const_iterator I = Successors.begin(), 56 E = Successors.end(); I != E; ++I)
|
H A D | IntervalPartition.cpp | 60 for (Interval::succ_iterator I = Int->Successors.begin(), 61 E = Int->Successors.end(); I != E; ++I)
|
/macosx-10.9.5/llvmCore-3425.0.33/unittests/Support/ |
H A D | IntegersSubsetTest.cpp | 120 unsigned Successors[3] = {0, 1, 2}; local 126 TheMapping.add(Int(10*i), Int(10*i + 9), Successors + i); 127 TheMapping.add(Int(111), Int(222), Successors); 137 EXPECT_EQ(CaseIt->first, Successors + i); 145 ImproperMapping.add(Int(10), Int(11), Successors + 0); 146 ImproperMapping.add(Int(11), Int(12), Successors + 1); 153 ProperMapping.add(Int(10), Int(11), Successors + 0); 154 ProperMapping.add(Int(12), Int(13), Successors + 1); 163 ToBeOptimized.add(Int(i * 10), Int(i * 10 + 1), Successors + i); 164 ToBeOptimized.add(Int(i * 10 + 2), Int(i * 10 + 9), Successors [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 69 /// Predecessors/Successors - Keep track of the predecessor / successor 72 std::vector<MachineBasicBlock *> Successors; member in class:llvm::MachineBasicBlock 76 /// has the same order as Successors, or it is empty if we don't use it 273 succ_iterator succ_begin() { return Successors.begin(); } 274 const_succ_iterator succ_begin() const { return Successors.begin(); } 275 succ_iterator succ_end() { return Successors.end(); } 276 const_succ_iterator succ_end() const { return Successors.end(); } 278 { return Successors.rbegin(); } 280 { return Successors.rbegin(); } 282 { return Successors [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 77 std::map<change_ty, std::vector<change_ty> > Successors; member in class:__anon10296::DAGDeltaAlgorithmImpl 102 assert(Successors.count(Node) && "Invalid node!"); 103 return Successors[Node].begin(); 106 assert(Successors.count(Node) && "Invalid node!"); 107 return Successors[Node].end(); 193 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); 198 Successors[it->first].push_back(it->second);
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/ |
H A D | MachineBasicBlock.cpp | 315 OS << " Successors according to CFG:"; 447 Weights.resize(Successors.size()); 452 Successors.push_back(succ); 458 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); 459 assert(I != Successors.end() && "Not a current successor!"); 467 Successors.erase(I); 472 assert(I != Successors.end() && "Not a current successor!"); 481 return Successors.erase(I); 521 Successors [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 460 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local 461 if (Successors) { 464 if (Successors == 1) { 486 for (int i = 0; i != Successors; ++i) 489 Edge += Successors; 555 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local 556 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) { 557 for (int i = 0; i != Successors; ++i) { 566 Edge += Successors;
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/ |
H A D | CodeGenPrepare.cpp | 191 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB)); 198 II = Successors.begin(), IE = Successors.end(); II != IE; ++II) 209 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB)); 214 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Target/ARM/ |
H A D | ARMISelLowering.cpp | 6258 SmallVector<MachineBasicBlock*, 4> Successors(BB->succ_begin(), 6260 while (!Successors.empty()) { 6261 MachineBasicBlock *SMBB = Successors.pop_back_val();
|