Home
last modified time | relevance | path

Searched refs:Predecessors (Results 1 – 8 of 8) sorted by relevance

/freebsd-10-stable/contrib/llvm/lib/MC/
DMCFunction.cpp64 Predecessors.push_back(MCBB); in addPredecessor()
68 return std::find(Predecessors.begin(), Predecessors.end(), in isPredecessor()
69 MCBB) != Predecessors.end(); in isPredecessor()
/freebsd-10-stable/contrib/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h71 std::vector<MachineBasicBlock *> Predecessors;
260 pred_iterator pred_begin() { return Predecessors.begin(); }
261 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
262 pred_iterator pred_end() { return Predecessors.end(); }
263 const_pred_iterator pred_end() const { return Predecessors.end(); }
265 { return Predecessors.rbegin();}
267 { return Predecessors.rbegin();}
269 { return Predecessors.rend(); }
271 { return Predecessors.rend(); }
273 return (unsigned)Predecessors.size();
[all …]
/freebsd-10-stable/contrib/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp76 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anon5dca77610111::DAGDeltaAlgorithmImpl
84 assert(Predecessors.count(Node) && "Invalid node!"); in pred_begin()
85 return Predecessors[Node].begin(); in pred_begin()
88 assert(Predecessors.count(Node) && "Invalid node!"); in pred_end()
89 return Predecessors[Node].end(); in pred_end()
192 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
197 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
/freebsd-10-stable/contrib/llvm/include/llvm/Analysis/
DInterval.h69 std::vector<BasicBlock*> Predecessors; variable
118 return I->Predecessors.begin(); in pred_begin()
121 return I->Predecessors.end(); in pred_end()
/freebsd-10-stable/contrib/llvm/include/llvm/MC/
DMCFunction.h45 BasicBlockListTy Predecessors; variable
65 pred_const_iterator pred_begin() const { return Predecessors.begin(); } in pred_begin()
66 pred_const_iterator pred_end() const { return Predecessors.end(); } in pred_end()
/freebsd-10-stable/contrib/llvm/lib/Analysis/
DInterval.cpp50 for (std::vector<BasicBlock*>::const_iterator I = Predecessors.begin(), in print()
51 E = Predecessors.end(); I != E; ++I) in print()
DIntervalPartition.cpp62 getBlockInterval(*I)->Predecessors.push_back(Header); in updatePredecessors()
/freebsd-10-stable/contrib/llvm/lib/CodeGen/
DMachineBasicBlock.cpp565 Predecessors.push_back(pred); in addPredecessor()
569 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), pred); in removePredecessor()
570 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); in removePredecessor()
571 Predecessors.erase(I); in removePredecessor()