Searched refs:BBE (Results 1 - 15 of 15) sorted by relevance
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MIRCanonicalizerPass.cpp | 241 const auto BBE = MBB->instr_end(); local
242 MachineBasicBlock::iterator DefI = BBE;
243 MachineBasicBlock::iterator UseI = BBE;
245 for (auto BBI = MBB->instr_begin(); BBI != BBE; ++BBI) {
247 if (DefI != BBE && UseI != BBE)
261 if (DefI == BBE || UseI == BBE)
|
| H A D | LiveVariables.cpp | 770 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); local
771 for (; BBI != BBE && BBI->isPHI(); ++BBI) {
782 for (; BBI != BBE; ++BBI) {
828 BBE = SuccBB->end();
829 BBI != BBE && BBI->isPHI(); ++BBI) {
|
| H A D | ModuloSchedule.cpp | 216 BBE = BB->getFirstTerminator();
217 BBI != BBE; ++BBI) {
385 BBE = BB->getFirstNonPHI();
386 BBI != BBE; ++BBI) {
623 BBE = BB->instr_end();
624 BBI != BBE; ++BBI) {
765 BBE = KernelBB->getFirstNonPHI();
766 BBI != BBE;) {
|
| H A D | PHIElimination.cpp | 603 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end();
604 BBI != BBE && BBI->isPHI(); ++BBI) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Dominators.cpp | 181 bool DominatorTree::dominates(const BasicBlockEdge &BBE, argument
185 const BasicBlock *Start = BBE.getStart();
186 const BasicBlock *End = BBE.getEnd();
233 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { argument
237 if (PN && PN->getParent() == BBE.getEnd() &&
238 PN->getIncomingBlock(U) == BBE.getStart())
248 return dominates(BBE, UseBB);
|
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Dominators.h | 171 /// If BBE is not a unique edge between start and end of the edge, it can
173 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
174 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
| H A D | NVPTXGenericToNVVM.cpp | 107 for (Function::iterator BBI = I->begin(), BBE = I->end(); BBI != BBE;
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MustExecute.cpp | 63 BBE = CurLoop->block_end();
64 (BB != BBE) && !MayThrow; ++BB)
|
| H A D | MemorySSAUpdater.cpp | 1388 auto BBI = I->getIterator(), BBE = BB->end(); local
1391 while (BBI != BBE)
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | MergeFunctions.cpp | 532 for (Function::iterator BBI = std::next(G->begin()), BBE = G->end();
533 BBI != BBE; ++BBI) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | IndVarSimplify.cpp | 1554 auto DominatesNarrowUser = [this, NarrowUser] (BasicBlockEdge BBE) {
1555 return BBE.isSingleEdge() &&
1556 DT->dominates(BBE, NarrowUser->getParent());
|
| H A D | DeadStoreElimination.cpp | 1211 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | Local.cpp | 1966 BasicBlock::iterator BBI = I->getIterator(), BBE = BB->end();
1967 while (BBI != BBE) {
|
| H A D | SimplifyCFG.cpp | 2031 BBE = std::prev(ThenBB->end());
2032 BBI != BBE; ++BBI) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Bitcode/Reader/ |
| H A D | BitcodeReader.cpp | 2843 Function::iterator BBI = Fn->begin(), BBE = Fn->end(); local
2845 if (BBI == BBE)
|
Completed in 276 milliseconds