Searched refs:MBB1 (Results 1 - 7 of 7) sorted by relevance
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | BranchFolding.cpp | 325 static unsigned ComputeCommonTailLength(MachineBasicBlock *MBB1, argument
329 MachineBasicBlock::iterator MBBI1 = MBB1->end();
334 MBBI1 = skipBackwardPastNonInstructions(MBBI1, MBB1);
336 if (MBBI1 == MBB1->end() || MBBI2 == MBB2->end())
531 /// MBB1, MBB2 The blocks to check
534 /// MBB1 and MBB2
536 /// instruction in the common tail shared by MBB1,MBB2
537 /// SuccBB A common successor of MBB1, MBB2 which are in a canonical form
544 ProfitableToMerge(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2, argument
555 auto EHScope1 = EHScopeMembership.find(MBB1);
1239 IsBetterFallthrough(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2) argument
[all...] |
| H A D | MachineCSE.cpp | 142 /// and MBB1 to CandidateBB.
145 MachineBasicBlock *MBB1);
806 auto MBB1 = PREMap[MI]; local
808 !DT->properlyDominates(MBB, MBB1) &&
809 "MBB cannot properly dominate MBB1 while DFS through dominators tree!");
810 auto CMBB = DT->findNearestCommonDominator(MBB, MBB1);
814 if (!isProfitableToHoistInto(CMBB, MBB, MBB1))
819 if (CMBB != MBB1) {
820 auto BB = MBB->getBasicBlock(), BB1 = MBB1->getBasicBlock();
877 MachineBasicBlock *MBB1) {
875 isProfitableToHoistInto(MachineBasicBlock *CandidateBB, MachineBasicBlock *MBB, MachineBasicBlock *MBB1) argument
[all...] |
| H A D | IfConversion.cpp | 834 MachineBasicBlock *MBB1,
836 const MachineBasicBlock::reverse_iterator B1 = MBB1->rend();
838 MachineBasicBlock::reverse_iterator E1 = MBB1->rbegin();
1820 MachineBasicBlock &MBB1 = *BBI1->BB; local
1831 Redefs.addLiveIns(MBB1);
1837 MachineBasicBlock::iterator DI1 = MBB1.getFirstNonDebugInstr();
1846 if (DI1 == MBB1.end())
1865 for (const MachineInstr &MI : make_range(MBB1.begin(), DI1)) {
1871 BBI.BB->splice(BBI.BB->end(), &MBB1, MBB1
833 verifySameBranchInstructions( MachineBasicBlock *MBB1, MachineBasicBlock *MBB2) argument
[all...] |
| H A D | LiveIntervals.cpp | 841 MachineBasicBlock *MBB1 = Indexes->getMBBFromIndex(Start);
843 return MBB1 == MBB2 ? MBB1 : nullptr;
|
| H A D | SplitKit.cpp | 984 MachineBasicBlock *MBB1 = LIS.getMBBFromIndex((*It1)->def); local
986 if (MBB1 == MBB2) {
988 } else if (MDT.dominates(MBB1, MBB2)) {
990 } else if (MDT.dominates(MBB2, MBB1)) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCMIPeephole.cpp | 1260 MachineBasicBlock *MBB1 = nullptr, *MBBtoMoveCmp = nullptr; local
1262 // For fully redundant case, we select two basic blocks MBB1 and MBB2
1265 // - MBB1 is the only predecessor of MBB2, and
1278 // | MBB1 | (w/ 2 succ) | MBBtoMoveCmp | | MBB1 | (w/ 2 succ)
1289 if (!eligibleForCompareElimination(MBB2, MBB1, MBBtoMoveCmp, MRI))
1292 MachineInstr *BI1 = &*MBB1->getFirstInstrTerminator();
1344 MBB1, &MBB2, MRI);
1346 MBB1, &MBB2, MRI);
1368 MBB1,
[all...] |
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDILCFGStructurizer.cpp | 1613 MachineBasicBlock *MBB1 = *MBB->succ_begin();
1615 if (MBB1 != MBB2)
1622 SHOWNEWBLK(MBB1, "Removing redundant successor");
1623 MBB->removeSuccessor(MBB1, true);
|
Completed in 139 milliseconds