Searched refs:Predecessors (Results 1 - 9 of 9) sorted by relevance
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | Interval.cpp | 49 OS << "Interval Predecessors:\n"; 50 for (std::vector<BasicBlock*>::const_iterator I = Predecessors.begin(), 51 E = Predecessors.end(); I != E; ++I)
|
H A D | IntervalPartition.cpp | 62 getBlockInterval(*I)->Predecessors.push_back(Header);
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | Interval.h | 63 /// Predecessors - List of BasicBlocks that have this Interval's header block 66 std::vector<BasicBlock*> Predecessors; member in class:llvm::Interval 115 return I->Predecessors.begin(); 118 return I->Predecessors.end();
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | ThreadSafetyTIL.cpp | 57 unsigned Idx = Predecessors.size(); 58 Predecessors.reserveCheck(1, Arena); 59 Predecessors.push_back(Pred); 71 Predecessors.reserve(NumPreds, Arena); 198 for (auto *Pred : Predecessors) 212 for (auto *Pred : Predecessors) {
|
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 91 std::vector<MachineBasicBlock *> Predecessors; member in class:llvm::MachineBasicBlock 294 pred_iterator pred_begin() { return Predecessors.begin(); } 295 const_pred_iterator pred_begin() const { return Predecessors.begin(); } 296 pred_iterator pred_end() { return Predecessors.end(); } 297 const_pred_iterator pred_end() const { return Predecessors.end(); } 299 { return Predecessors.rbegin();} 301 { return Predecessors.rbegin();} 303 { return Predecessors.rend(); } 305 { return Predecessors.rend(); } 307 return (unsigned)Predecessors [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 75 std::map<change_ty, std::vector<change_ty> > Predecessors; member in class:__anon2651::DAGDeltaAlgorithmImpl 83 assert(Predecessors.count(Node) && "Invalid node!"); 84 return Predecessors[Node].begin(); 87 assert(Predecessors.count(Node) && "Invalid node!"); 88 return Predecessors[Node].end(); 186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); 191 Predecessors[it->second].push_back(it->first);
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | SampleProfile.cpp | 184 /// \brief Predecessors for each basic block in the CFG. 185 BlockEdgeMap Predecessors; member in class:__anon3139::SampleProfileLoader 388 Predecessors.clear(); 867 for (auto *Pred : Predecessors[BB]) { 959 if (!Predecessors[B1].empty()) 964 Predecessors[B1].push_back(B2);
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | MachineBasicBlock.cpp | 299 OS << " Predecessors according to CFG:"; 607 Predecessors.push_back(Pred); 611 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), Pred); 612 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); 613 Predecessors.erase(I);
|
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTIL.h | 1561 size_t numPredecessors() const { return Predecessors.size(); } 1579 BlockArray &predecessors() { return Predecessors; } 1580 const BlockArray &predecessors() const { return Predecessors; } 1621 /// Return the index of BB, or Predecessors.size if BB is not a predecessor. 1623 auto I = std::find(Predecessors.cbegin(), Predecessors.cend(), BB); 1624 return std::distance(Predecessors.cbegin(), I); 1673 BlockArray Predecessors; // Predecessor blocks in the CFG. member in class:clang::threadSafety::BasicBlock
|
Completed in 187 milliseconds