1 //===- RegionPass.cpp - Region Pass and Region Pass Manager ---------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements RegionPass and RGPassManager. All region optimization
11 // and transformation passes are derived from RegionPass. RGPassManager is
12 // responsible for managing RegionPasses.
13 // Most of this code has been COPIED from LoopPass.cpp
15 //===----------------------------------------------------------------------===//
16 #include "llvm/Analysis/RegionPass.h"
17 #include "llvm/IR/OptBisect.h"
18 #include "llvm/IR/PassTimingInfo.h"
19 #include "llvm/Support/Debug.h"
20 #include "llvm/Support/Timer.h"
21 #include "llvm/Support/raw_ostream.h"
24 #define DEBUG_TYPE "regionpassmgr"
26 //===----------------------------------------------------------------------===//
30 char RGPassManager::ID
= 0;
32 RGPassManager::RGPassManager()
33 : FunctionPass(ID
), PMDataManager() {
34 skipThisRegion
= false;
35 redoThisRegion
= false;
37 CurrentRegion
= nullptr;
40 // Recurse through all subregions and all regions into RQ.
41 static void addRegionIntoQueue(Region
&R
, std::deque
<Region
*> &RQ
) {
43 for (const auto &E
: R
)
44 addRegionIntoQueue(*E
, RQ
);
47 /// Pass Manager itself does not invalidate any analysis info.
48 void RGPassManager::getAnalysisUsage(AnalysisUsage
&Info
) const {
49 Info
.addRequired
<RegionInfoPass
>();
50 Info
.setPreservesAll();
53 /// run - Execute all of the passes scheduled for execution. Keep track of
54 /// whether any of the passes modifies the function, and if so, return true.
55 bool RGPassManager::runOnFunction(Function
&F
) {
56 RI
= &getAnalysis
<RegionInfoPass
>().getRegionInfo();
59 // Collect inherited analysis from Module level pass manager.
60 populateInheritedAnalysis(TPM
->activeStack
);
62 addRegionIntoQueue(*RI
->getTopLevelRegion(), RQ
);
64 if (RQ
.empty()) // No regions, skip calling finalizers
68 for (Region
*R
: RQ
) {
69 for (unsigned Index
= 0; Index
< getNumContainedPasses(); ++Index
) {
70 RegionPass
*RP
= (RegionPass
*)getContainedPass(Index
);
71 Changed
|= RP
->doInitialization(R
, *this);
78 CurrentRegion
= RQ
.back();
79 skipThisRegion
= false;
80 redoThisRegion
= false;
82 // Run all passes on the current Region.
83 for (unsigned Index
= 0; Index
< getNumContainedPasses(); ++Index
) {
84 RegionPass
*P
= (RegionPass
*)getContainedPass(Index
);
86 if (isPassDebuggingExecutionsOrMore()) {
87 dumpPassInfo(P
, EXECUTION_MSG
, ON_REGION_MSG
,
88 CurrentRegion
->getNameStr());
92 initializeAnalysisImpl(P
);
95 PassManagerPrettyStackEntry
X(P
, *CurrentRegion
->getEntry());
97 TimeRegion
PassTimer(getPassTimer(P
));
98 Changed
|= P
->runOnRegion(CurrentRegion
, *this);
101 if (isPassDebuggingExecutionsOrMore()) {
103 dumpPassInfo(P
, MODIFICATION_MSG
, ON_REGION_MSG
,
104 skipThisRegion
? "<deleted>" :
105 CurrentRegion
->getNameStr());
109 if (!skipThisRegion
) {
110 // Manually check that this region is still healthy. This is done
111 // instead of relying on RegionInfo::verifyRegion since RegionInfo
112 // is a function pass and it's really expensive to verify every
113 // Region in the function every time. That level of checking can be
114 // enabled with the -verify-region-info option.
116 TimeRegion
PassTimer(getPassTimer(P
));
117 CurrentRegion
->verifyRegion();
120 // Then call the regular verifyAnalysis functions.
121 verifyPreservedAnalysis(P
);
124 removeNotPreservedAnalysis(P
);
125 recordAvailableAnalysis(P
);
127 (!isPassDebuggingExecutionsOrMore() || skipThisRegion
) ?
128 "<deleted>" : CurrentRegion
->getNameStr(),
132 // Do not run other passes on this region.
136 // If the region was deleted, release all the region passes. This frees up
137 // some memory, and avoids trouble with the pass manager trying to call
138 // verifyAnalysis on them.
140 for (unsigned Index
= 0; Index
< getNumContainedPasses(); ++Index
) {
141 Pass
*P
= getContainedPass(Index
);
142 freePass(P
, "<deleted>", ON_REGION_MSG
);
145 // Pop the region from queue after running all passes.
149 RQ
.push_back(CurrentRegion
);
151 // Free all region nodes created in region passes.
152 RI
->clearNodeCache();
156 for (unsigned Index
= 0; Index
< getNumContainedPasses(); ++Index
) {
157 RegionPass
*P
= (RegionPass
*)getContainedPass(Index
);
158 Changed
|= P
->doFinalization();
161 // Print the region tree after all pass.
162 LLVM_DEBUG(dbgs() << "\nRegion tree of function " << F
.getName()
163 << " after all region Pass:\n";
164 RI
->dump(); dbgs() << "\n";);
169 /// Print passes managed by this manager
170 void RGPassManager::dumpPassStructure(unsigned Offset
) {
171 errs().indent(Offset
*2) << "Region Pass Manager\n";
172 for (unsigned Index
= 0; Index
< getNumContainedPasses(); ++Index
) {
173 Pass
*P
= getContainedPass(Index
);
174 P
->dumpPassStructure(Offset
+ 1);
175 dumpLastUses(P
, Offset
+1);
180 //===----------------------------------------------------------------------===//
182 class PrintRegionPass
: public RegionPass
{
185 raw_ostream
&Out
; // raw_ostream to print on.
189 PrintRegionPass(const std::string
&B
, raw_ostream
&o
)
190 : RegionPass(ID
), Banner(B
), Out(o
) {}
192 void getAnalysisUsage(AnalysisUsage
&AU
) const override
{
193 AU
.setPreservesAll();
196 bool runOnRegion(Region
*R
, RGPassManager
&RGM
) override
{
198 for (const auto *BB
: R
->blocks()) {
202 Out
<< "Printing <null> Block";
208 StringRef
getPassName() const override
{ return "Print Region IR"; }
211 char PrintRegionPass::ID
= 0;
212 } //end anonymous namespace
214 //===----------------------------------------------------------------------===//
217 // Check if this pass is suitable for the current RGPassManager, if
218 // available. This pass P is not suitable for a RGPassManager if P
219 // is not preserving higher level analysis info used by other
220 // RGPassManager passes. In such case, pop RGPassManager from the
221 // stack. This will force assignPassManager() to create new
222 // LPPassManger as expected.
223 void RegionPass::preparePassManager(PMStack
&PMS
) {
225 // Find RGPassManager
226 while (!PMS
.empty() &&
227 PMS
.top()->getPassManagerType() > PMT_RegionPassManager
)
231 // If this pass is destroying high level information that is used
232 // by other passes that are managed by LPM then do not insert
233 // this pass in current LPM. Use new RGPassManager.
234 if (PMS
.top()->getPassManagerType() == PMT_RegionPassManager
&&
235 !PMS
.top()->preserveHigherLevelAnalysis(this))
239 /// Assign pass manager to manage this pass.
240 void RegionPass::assignPassManager(PMStack
&PMS
,
241 PassManagerType PreferredType
) {
242 // Find RGPassManager
243 while (!PMS
.empty() &&
244 PMS
.top()->getPassManagerType() > PMT_RegionPassManager
)
249 // Create new Region Pass Manager if it does not exist.
250 if (PMS
.top()->getPassManagerType() == PMT_RegionPassManager
)
251 RGPM
= (RGPassManager
*)PMS
.top();
254 assert (!PMS
.empty() && "Unable to create Region Pass Manager");
255 PMDataManager
*PMD
= PMS
.top();
257 // [1] Create new Region Pass Manager
258 RGPM
= new RGPassManager();
259 RGPM
->populateInheritedAnalysis(PMS
);
261 // [2] Set up new manager's top level manager
262 PMTopLevelManager
*TPM
= PMD
->getTopLevelManager();
263 TPM
->addIndirectPassManager(RGPM
);
265 // [3] Assign manager to manage this new manager. This may create
266 // and push new managers into PMS
267 TPM
->schedulePass(RGPM
);
269 // [4] Push new manager into PMS
276 /// Get the printer pass
277 Pass
*RegionPass::createPrinterPass(raw_ostream
&O
,
278 const std::string
&Banner
) const {
279 return new PrintRegionPass(Banner
, O
);
282 bool RegionPass::skipRegion(Region
&R
) const {
283 Function
&F
= *R
.getEntry()->getParent();
284 if (!F
.getContext().getOptPassGate().shouldRunPass(this, R
))
287 if (F
.hasFnAttribute(Attribute::OptimizeNone
)) {
288 // Report this only once per function.
289 if (R
.getEntry() == &F
.getEntryBlock())
290 LLVM_DEBUG(dbgs() << "Skipping pass '" << getPassName()
291 << "' on function " << F
.getName() << "\n");