Searched refs:Successors (Results 1 - 13 of 13) sorted by relevance

/external/llvm/lib/MC/MCAnalysis/
H A DMCFunction.cpp49 Successors.push_back(MCBB);
53 return std::find(Successors.begin(), Successors.end(),
54 MCBB) != Successors.end();
71 assert(SplitBB->Successors.empty() &&
73 SplitBB->Successors = Successors;
74 Successors.clear();
/external/llvm/lib/Analysis/
H A DInterval.cpp54 OS << "Interval Successors:\n";
55 for (std::vector<BasicBlock*>::const_iterator I = Successors.begin(),
56 E = Successors.end(); I != E; ++I)
H A DIntervalPartition.cpp60 for (Interval::succ_iterator I = Int->Successors.begin(),
61 E = Int->Successors.end(); I != E; ++I)
/external/llvm/include/llvm/Analysis/
H A DInterval.h57 /// Successors - List of BasicBlocks that are reachable directly from nodes in
61 std::vector<BasicBlock*> Successors; member in class:llvm::Interval
79 for (unsigned i = 0; i < Successors.size(); ++i)
80 if (Successors[i] == BB) return true;
83 //return find(Successors.begin(), Successors.end(), BB) != Successors.end();
105 return I->Successors.begin();
108 return I->Successors.end();
H A DIntervalIterator.h202 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/include/llvm/MC/MCAnalysis/
H A DMCFunction.h42 /// \name Predecessors/Successors, to represent the CFG.
45 BasicBlockListTy Successors; member in class:llvm::MCBasicBlock
59 /// MC CFG access: Predecessors/Successors.
62 succ_const_iterator succ_begin() const { return Successors.begin(); }
63 succ_const_iterator succ_end() const { return Successors.end(); }
/external/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h69 /// 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
286 succ_iterator succ_begin() { return Successors.begin(); }
287 const_succ_iterator succ_begin() const { return Successors.begin(); }
288 succ_iterator succ_end() { return Successors.end(); }
289 const_succ_iterator succ_end() const { return Successors.end(); }
291 { return Successors.rbegin(); }
293 { return Successors.rbegin(); }
295 { return Successors
[all...]
/external/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp79 std::map<change_ty, std::vector<change_ty> > Successors; member in class:__anon25071::DAGDeltaAlgorithmImpl
104 assert(Successors.count(Node) && "Invalid node!");
105 return Successors[Node].begin();
108 assert(Successors.count(Node) && "Invalid node!");
109 return Successors[Node].end();
195 Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
200 Successors[it->first].push_back(it->second);
/external/llvm/lib/CodeGen/
H A DMachineBasicBlock.cpp325 OS << " Successors according to CFG:";
493 Weights.resize(Successors.size());
498 Successors.push_back(succ);
504 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
505 assert(I != Successors.end() && "Not a current successor!");
513 Successors.erase(I);
518 assert(I != Successors.end() && "Not a current successor!");
527 return Successors.erase(I);
567 Successors
[all...]
H A DCodeGenPrepare.cpp220 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB));
225 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
235 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB));
240 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
/external/llvm/lib/Transforms/Scalar/
H A DSampleProfile.cpp210 /// \brief Successors for each basic block in the CFG.
211 BlockEdgeMap Successors; member in class:__anon25494::SampleFunctionProfile
782 for (size_t I = 0; I < Successors[BB].size(); I++) {
783 Edge E = std::make_pair(BB, Successors[BB][I]);
876 if (!Successors[B1].empty())
881 Successors[B1].push_back(B2);
/external/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp606 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local
607 if (Successors) {
608 if (Successors == 1) {
629 for (int i = 0; i != Successors; ++i)
633 Edge += Successors;
727 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); local
728 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) {
729 for (int i = 0; i != Successors; ++i) {
738 Edge += Successors;
/external/llvm/lib/Target/ARM/
H A DARMISelLowering.cpp6754 SmallVector<MachineBasicBlock*, 4> Successors(BB->succ_begin(),
6756 while (!Successors.empty()) {
6757 MachineBasicBlock *SMBB = Successors.pop_back_val();

Completed in 400 milliseconds