/external/llvm/lib/MC/ |
H A D | MCFunction.cpp | 40 Successors.push_back(MCBB); 44 return std::find(Successors.begin(), Successors.end(), 45 MCBB) != Successors.end();
|
/external/llvm/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());
|
/external/llvm/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)
|
/external/llvm/include/llvm/MC/ |
H A D | MCFunction.h | 41 /// \name Predecessors/Successors, to represent the CFG. 44 BasicBlockListTy Successors; member in class:llvm::MCBasicBlock 58 /// MC CFG access: Predecessors/Successors. 61 succ_const_iterator succ_begin() const { return Successors.begin(); } 62 succ_const_iterator succ_end() const { return Successors.end(); }
|
/external/llvm/unittests/Support/ |
H A D | IntegersSubsetTest.cpp | 118 unsigned Successors[3] = {0, 1, 2}; local 124 TheMapping.add(Int(10*i), Int(10*i + 9), Successors + i); 125 TheMapping.add(Int(111), Int(222), Successors); 135 EXPECT_EQ(CaseIt->first, Successors + i); 143 ImproperMapping.add(Int(10), Int(11), Successors + 0); 144 ImproperMapping.add(Int(11), Int(12), Successors + 1); 151 ProperMapping.add(Int(10), Int(11), Successors + 0); 152 ProperMapping.add(Int(12), Int(13), Successors + 1); 161 ToBeOptimized.add(Int(i * 10), Int(i * 10 + 1), Successors + i); 162 ToBeOptimized.add(Int(i * 10 + 2), Int(i * 10 + 9), Successors [all...] |
/external/llvm/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 75 /// has the same order as Successors, or it is empty if we don't use it 276 succ_iterator succ_begin() { return Successors.begin(); } 277 const_succ_iterator succ_begin() const { return Successors.begin(); } 278 succ_iterator succ_end() { return Successors.end(); } 279 const_succ_iterator succ_end() const { return Successors.end(); } 281 { return Successors.rbegin(); } 283 { return Successors.rbegin(); } 285 { return Successors [all...] |
/external/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 77 std::map<change_ty, std::vector<change_ty> > Successors; member in class:__anon21292::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);
|
/external/llvm/lib/CodeGen/ |
H A D | MachineBasicBlock.cpp | 323 OS << " Successors according to CFG:"; 487 Weights.resize(Successors.size()); 492 Successors.push_back(succ); 498 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); 499 assert(I != Successors.end() && "Not a current successor!"); 507 Successors.erase(I); 512 assert(I != Successors.end() && "Not a current successor!"); 521 return Successors.erase(I); 561 Successors [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 520 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local 521 if (Successors) { 524 if (Successors == 1) { 543 for (int i = 0; i != Successors; ++i) 546 Edge += Successors; 641 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local 642 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) { 643 for (int i = 0; i != Successors; ++i) { 652 Edge += Successors;
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | CodeGenPrepare.cpp | 192 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB)); 197 II = Successors.begin(), IE = Successors.end(); II != IE; ++II) 207 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB)); 212 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
|
/external/llvm/lib/Target/ARM/ |
H A D | ARMISelLowering.cpp | 6941 SmallVector<MachineBasicBlock*, 4> Successors(BB->succ_begin(), 6943 while (!Successors.empty()) { 6944 MachineBasicBlock *SMBB = Successors.pop_back_val();
|