LLVM 22.0.0git
PPCCTRLoopsVerify.cpp
Go to the documentation of this file.
1//===-- PPCCTRLoops.cpp - Verify CTR loops -----------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This pass verifies that all bdnz/bdz instructions are dominated by a loop
10// mtctr before any other instructions that might clobber the ctr register.
11//
12//===----------------------------------------------------------------------===//
13
14// CTR loops are produced by the HardwareLoops pass and this pass is simply a
15// verification that no invalid CTR loops are produced. As such, it isn't
16// something that needs to be run (or even defined) for Release builds so the
17// entire file is guarded by NDEBUG.
18#ifndef NDEBUG
20#include "PPC.h"
22#include "llvm/ADT/StringRef.h"
33#include "llvm/Pass.h"
34#include "llvm/PassRegistry.h"
35#include "llvm/Support/Debug.h"
39
40using namespace llvm;
41
42#define DEBUG_TYPE "ppc-ctrloops-verify"
43
44namespace {
45
46 struct PPCCTRLoopsVerify : public MachineFunctionPass {
47 public:
48 static char ID;
49
50 PPCCTRLoopsVerify() : MachineFunctionPass(ID) {
52 }
53
54 void getAnalysisUsage(AnalysisUsage &AU) const override {
57 }
58
59 bool runOnMachineFunction(MachineFunction &MF) override;
60
61 private:
63 };
64
65 char PPCCTRLoopsVerify::ID = 0;
66} // end anonymous namespace
67
68INITIALIZE_PASS_BEGIN(PPCCTRLoopsVerify, "ppc-ctr-loops-verify",
69 "PowerPC CTR Loops Verify", false, false)
71INITIALIZE_PASS_END(PPCCTRLoopsVerify, "ppc-ctr-loops-verify",
72 "PowerPC CTR Loops Verify", false, false)
73
75 return new PPCCTRLoopsVerify();
76}
77
78static bool clobbersCTR(const MachineInstr &MI) {
79 for (const MachineOperand &MO : MI.operands()) {
80 if (MO.isReg()) {
81 if (MO.isDef() && (MO.getReg() == PPC::CTR || MO.getReg() == PPC::CTR8))
82 return true;
83 } else if (MO.isRegMask()) {
84 if (MO.clobbersPhysReg(PPC::CTR) || MO.clobbersPhysReg(PPC::CTR8))
85 return true;
86 }
87 }
88
89 return false;
90}
91
97 bool CheckPreds;
98
99 if (I == MBB->begin()) {
100 Visited.insert(MBB);
101 goto queue_preds;
102 } else
103 --I;
104
105check_block:
106 Visited.insert(MBB);
107 if (I == MBB->end())
108 goto queue_preds;
109
110 CheckPreds = true;
111 for (MachineBasicBlock::iterator IE = MBB->begin();; --I) {
112 unsigned Opc = I->getOpcode();
113 if (Opc == PPC::MTCTRloop || Opc == PPC::MTCTR8loop) {
114 CheckPreds = false;
115 break;
116 }
117
118 if (I != BI && clobbersCTR(*I)) {
120 << ") instruction " << *I
121 << " clobbers CTR, invalidating "
122 << printMBBReference(*BI->getParent()) << " ("
123 << BI->getParent()->getFullName() << ") instruction "
124 << *BI << "\n");
125 return false;
126 }
127
128 if (I == IE)
129 break;
130 }
131
132 if (!CheckPreds && Preds.empty())
133 return true;
134
135 if (CheckPreds) {
136queue_preds:
138 LLVM_DEBUG(dbgs() << "Unable to find a MTCTR instruction for "
139 << printMBBReference(*BI->getParent()) << " ("
140 << BI->getParent()->getFullName() << ") instruction "
141 << *BI << "\n");
142 return false;
143 }
144
145 append_range(Preds, MBB->predecessors());
146 }
147
148 do {
149 MBB = Preds.pop_back_val();
150 if (!Visited.count(MBB)) {
152 goto check_block;
153 }
154 } while (!Preds.empty());
155
156 return true;
157}
158
159bool PPCCTRLoopsVerify::runOnMachineFunction(MachineFunction &MF) {
160 MDT = &getAnalysis<MachineDominatorTreeWrapperPass>().getDomTree();
161
162 // Verify that all bdnz/bdz instructions are dominated by a loop mtctr before
163 // any other instructions that might clobber the ctr register.
164 for (MachineBasicBlock &MBB : MF) {
165 if (!MDT->isReachableFromEntry(&MBB))
166 continue;
167
169 MIIE = MBB.end(); MII != MIIE; ++MII) {
170 unsigned Opc = MII->getOpcode();
171 if (Opc == PPC::BDNZ8 || Opc == PPC::BDNZ ||
172 Opc == PPC::BDZ8 || Opc == PPC::BDZ)
173 if (!verifyCTRBranch(&MBB, MII))
174 llvm_unreachable("Invalid PPC CTR loop!");
175 }
176 }
177
178 return false;
179}
180#endif // NDEBUG
MachineBasicBlock & MBB
Hexagon Hardware Loops
IRTranslator LLVM IR MI
loops
Definition: LoopInfo.cpp:1231
#define I(x, y, z)
Definition: MD5.cpp:58
static bool verifyCTRBranch(MachineBasicBlock *MBB, MachineBasicBlock::iterator I)
ppc ctr loops PowerPC CTR Loops Verify
ppc ctr loops verify
static bool clobbersCTR(const MachineInstr &MI)
#define INITIALIZE_PASS_DEPENDENCY(depName)
Definition: PassSupport.h:42
#define INITIALIZE_PASS_END(passName, arg, name, cfg, analysis)
Definition: PassSupport.h:44
#define INITIALIZE_PASS_BEGIN(passName, arg, name, cfg, analysis)
Definition: PassSupport.h:39
This file defines the SmallVector class.
#define LLVM_DEBUG(...)
Definition: Debug.h:119
Represent the analysis usage information of a pass.
AnalysisUsage & addRequired()
FunctionPass class - This class is used to implement most global optimizations.
Definition: Pass.h:314
LLVM_ABI iterator getFirstTerminator()
Returns an iterator to the first terminator instruction of this basic block.
LLVM_ABI iterator getLastNonDebugInstr(bool SkipPseudoOp=true)
Returns an iterator to the last non-debug instruction in the basic block, or end().
const MachineFunction * getParent() const
Return the MachineFunction containing this basic block.
LLVM_ABI std::string getFullName() const
Return a formatted string to identify this block and its parent function.
iterator_range< pred_iterator > predecessors()
Analysis pass which computes a MachineDominatorTree.
DominatorTree Class - Concrete subclass of DominatorTreeBase that is used to compute a normal dominat...
MachineFunctionPass - This class adapts the FunctionPass interface to allow convenient creation of pa...
void getAnalysisUsage(AnalysisUsage &AU) const override
getAnalysisUsage - Subclasses that override getAnalysisUsage must call this.
virtual bool runOnMachineFunction(MachineFunction &MF)=0
runOnMachineFunction - This method must be overloaded to perform the desired machine code transformat...
Representation of each machine instruction.
Definition: MachineInstr.h:72
MachineOperand class - Representation of each machine instruction operand.
static LLVM_ABI PassRegistry * getPassRegistry()
getPassRegistry - Access the global registry object, which is automatically initialized at applicatio...
size_type count(ConstPtrType Ptr) const
count - Return 1 if the specified pointer is in the set, 0 otherwise.
Definition: SmallPtrSet.h:470
std::pair< iterator, bool > insert(PtrType Ptr)
Inserts Ptr if and only if there is no element in the container equal to Ptr.
Definition: SmallPtrSet.h:401
SmallPtrSet - This class implements a set which is optimized for holding SmallSize or less elements.
Definition: SmallPtrSet.h:541
bool empty() const
Definition: SmallVector.h:82
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small.
Definition: SmallVector.h:1197
#define llvm_unreachable(msg)
Marks that the current location is not supposed to be reachable.
unsigned ID
LLVM IR allows to use arbitrary numbers as calling convention identifiers.
Definition: CallingConv.h:24
This is an optimization pass for GlobalISel generic memory operations.
Definition: AddressRanges.h:18
void append_range(Container &C, Range &&R)
Wrapper function to append range R to container C.
Definition: STLExtras.h:2155
void initializePPCCTRLoopsVerifyPass(PassRegistry &)
LLVM_ABI raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.
Definition: Debug.cpp:207
FunctionPass * createPPCCTRLoopsVerify()
LLVM_ABI Printable printMBBReference(const MachineBasicBlock &MBB)
Prints a machine basic block reference.