| /external/llvm/lib/IR/ |
| Dominators.cpp | 143 bool DominatorTree::dominates(const BasicBlockEdge &BBE,
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 {
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/ |
| ErlangGC.cpp | 63 for (MachineFunction::iterator BBI = MF.begin(), BBE = MF.end(); BBI != BBE;
|
| GCStrategy.cpp | 372 BBE = MF.end(); BBI != BBE; ++BBI)
|
| PHIElimination.cpp | 555 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end();
556 BBI != BBE && BBI->isPHI(); ++BBI) {
|
| SjLjEHPrepare.cpp | 288 for (Function::iterator BB = F.begin(), BBE = F.end(); BB != BBE; ++BB) {
|
| LiveVariables.cpp | 788 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end();
789 for (; BBI != BBE && BBI->isPHI(); ++BBI) {
800 for (; BBI != BBE; ++BBI) {
|
| /external/llvm/lib/Transforms/Utils/ |
| 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) {
|
| LoopUnroll.cpp | 464 BBE = NewLoopBlocks.end(); BB != BBE; ++BB)
|
| Local.cpp | [all...] |
| SimplifyCFG.cpp | [all...] |
| /external/llvm/include/llvm/IR/ |
| 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/ |
| 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/ |
| CallGraph.cpp | 78 for (Function::iterator BB = F->begin(), BBE = F->end(); BB != BBE; ++BB)
|
| /external/llvm/unittests/IR/ |
| PassManagerTest.cpp | 38 for (Function::iterator BBI = F->begin(), BBE = F->end(); BBI != BBE; ++BBI)
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 379 for (typename BlkT::iterator BBI = BB->begin(), BBE = BB->end();
380 BBI != BBE; ++BBI) {
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXGenericToNVVM.cpp | 112 for (Function::iterator BBI = I->begin(), BBE = I->end(); BBI != BBE;
|
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 497 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) {
|
| LICM.cpp | 276 for (Loop::block_iterator BB = L->block_begin(), BBE = L->block_end();
277 (BB != BBE) && !MayThrow ; ++BB)
[all...] |
| MemCpyOptimizer.cpp | [all...] |
| Scalarizer.cpp | 246 for (Function::iterator BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI) {
|
| /external/llvm/lib/Bitcode/Reader/ |
| BitcodeReader.cpp | [all...] |
