Searched refs:BBE (Results 1 - 21 of 21) sorted by relevance
/external/llvm/lib/IR/ |
H A D | Dominators.cpp | 143 bool DominatorTree::dominates(const BasicBlockEdge &BBE, argument 148 assert(BBE.isSingleEdge()); 152 const BasicBlock *Start = BBE.getStart(); 153 const BasicBlock *End = BBE.getEnd(); 194 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { argument 198 assert(BBE.isSingleEdge()); 203 if (PN && PN->getParent() == BBE.getEnd() && 204 PN->getIncomingBlock(U) == BBE.getStart()) 214 return dominates(BBE, UseBB);
|
/external/llvm/lib/CodeGen/ |
H A D | ErlangGC.cpp | 63 for (MachineFunction::iterator BBI = MF.begin(), BBE = MF.end(); BBI != BBE;
|
H A D | GCStrategy.cpp | 372 BBE = MF.end(); BBI != BBE; ++BBI)
|
H A D | PHIElimination.cpp | 555 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end(); 556 BBI != BBE && BBI->isPHI(); ++BBI) {
|
H A D | SjLjEHPrepare.cpp | 288 for (Function::iterator BB = F.begin(), BBE = F.end(); BB != BBE; ++BB) {
|
H A D | LiveVariables.cpp | 788 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); local 789 for (; BBI != BBE && BBI->isPHI(); ++BBI) { 800 for (; BBI != BBE; ++BBI) {
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LCSSA.cpp | 104 BBE = ExitBlocks.end(); 105 BBI != BBE; ++BBI) { 197 for (Loop::block_iterator BBI = L.block_begin(), BBE = L.block_end(); 198 BBI != BBE; ++BBI) {
|
H A D | LoopUnroll.cpp | 464 BBE = NewLoopBlocks.end(); BB != BBE; ++BB)
|
H A D | Local.cpp | 1141 BasicBlock::iterator BBI = I, BBE = BB->end(); local 1142 while (BBI != BBE) {
|
H A D | SimplifyCFG.cpp | 1424 BBE = std::prev(ThenBB->end()); 1425 BBI != BBE; ++BBI) {
|
/external/llvm/include/llvm/IR/ |
H A D | Dominators.h | 97 bool dominates(const BasicBlockEdge &BBE, const Use &U) const; 98 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
|
/external/llvm/lib/MC/MCAnalysis/ |
H A D | MCModuleYAML.cpp | 338 for (MCFunction::const_iterator BBI = MCF.begin(), BBE = MCF.end(); 339 BBI != BBE; ++BBI) { 408 for (BBIt BBI = FI->BasicBlocks.begin(), BBE = FI->BasicBlocks.end(); 409 BBI != BBE; ++BBI) { 415 for (BBIt BBI = FI->BasicBlocks.begin(), BBE = FI->BasicBlocks.end(); 416 BBI != BBE; ++BBI) {
|
/external/llvm/lib/Analysis/IPA/ |
H A D | CallGraph.cpp | 78 for (Function::iterator BB = F->begin(), BBE = F->end(); BB != BBE; ++BB)
|
/external/llvm/unittests/IR/ |
H A D | PassManagerTest.cpp | 38 for (Function::iterator BBI = F->begin(), BBE = F->end(); BBI != BBE; ++BBI)
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 379 for (typename BlkT::iterator BBI = BB->begin(), BBE = BB->end(); 380 BBI != BBE; ++BBI) {
|
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTXGenericToNVVM.cpp | 112 for (Function::iterator BBI = I->begin(), BBE = I->end(); BBI != BBE;
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | DeadStoreElimination.cpp | 497 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) {
|
H A D | LICM.cpp | 276 for (Loop::block_iterator BB = L->block_begin(), BBE = L->block_end(); 277 (BB != BBE) && !MayThrow ; ++BB)
|
H A D | MemCpyOptimizer.cpp | 1005 for (Function::iterator BB = F.begin(), BBE = F.end(); BB != BBE; ++BB) {
|
H A D | Scalarizer.cpp | 246 for (Function::iterator BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI) {
|
/external/llvm/lib/Bitcode/Reader/ |
H A D | BitcodeReader.cpp | 1589 Function::iterator BBI = Fn->begin(), BBE = Fn->end(); local 1591 if (BBI == BBE)
|
Completed in 3745 milliseconds