1 //===- StrongPhiElimination.cpp - Eliminate PHI nodes by inserting copies -===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Owen Anderson and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass eliminates machine instruction PHI nodes by inserting copy
11 // instructions, using an intelligent copy-folding technique based on
12 // dominator information. This is technique is derived from:
14 // Budimlic, et al. Fast copy coalescing and live-range identification.
15 // In Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language
16 // Design and Implementation (Berlin, Germany, June 17 - 19, 2002).
17 // PLDI '02. ACM, New York, NY, 25-32.
18 // DOI= http://doi.acm.org/10.1145/512529.512534
20 //===----------------------------------------------------------------------===//
22 #define DEBUG_TYPE "strongphielim"
23 #include "llvm/CodeGen/Passes.h"
24 #include "llvm/CodeGen/BreakCriticalMachineEdge.h"
25 #include "llvm/CodeGen/LiveVariables.h"
26 #include "llvm/CodeGen/MachineDominators.h"
27 #include "llvm/CodeGen/MachineFunctionPass.h"
28 #include "llvm/CodeGen/MachineInstr.h"
29 #include "llvm/CodeGen/SSARegMap.h"
30 #include "llvm/Target/TargetInstrInfo.h"
31 #include "llvm/Target/TargetMachine.h"
32 #include "llvm/ADT/Statistic.h"
33 #include "llvm/Support/Compiler.h"
38 struct VISIBILITY_HIDDEN StrongPHIElimination : public MachineFunctionPass {
39 static char ID; // Pass identification, replacement for typeid
40 StrongPHIElimination() : MachineFunctionPass((intptr_t)&ID) {}
42 DenseMap<MachineBasicBlock*,
43 SmallVector<std::pair<unsigned, unsigned>, 2> > Waiting;
45 bool runOnMachineFunction(MachineFunction &Fn);
47 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
48 AU.addPreserved<LiveVariables>();
49 AU.addPreservedID(PHIEliminationID);
50 AU.addRequired<MachineDominatorTree>();
51 AU.addRequired<LiveVariables>();
53 MachineFunctionPass::getAnalysisUsage(AU);
56 virtual void releaseMemory() {
64 struct DomForestNode {
66 std::vector<DomForestNode*> children;
69 void addChild(DomForestNode* DFN) { children.push_back(DFN); }
72 typedef std::vector<DomForestNode*>::iterator iterator;
74 DomForestNode(unsigned r, DomForestNode* parent) : reg(r) {
76 parent->addChild(this);
80 for (iterator I = begin(), E = end(); I != E; ++I)
84 inline unsigned getReg() { return reg; }
86 inline DomForestNode::iterator begin() { return children.begin(); }
87 inline DomForestNode::iterator end() { return children.end(); }
90 DenseMap<MachineBasicBlock*, unsigned> preorder;
91 DenseMap<MachineBasicBlock*, unsigned> maxpreorder;
93 DenseMap<MachineBasicBlock*, std::vector<MachineInstr*> > waiting;
96 void computeDFS(MachineFunction& MF);
97 void processBlock(MachineBasicBlock* MBB);
99 std::vector<DomForestNode*> computeDomForest(std::set<unsigned>& instrs);
100 void processPHIUnion(MachineInstr* Inst,
101 std::set<unsigned>& PHIUnion,
102 std::vector<StrongPHIElimination::DomForestNode*>& DF,
103 std::vector<std::pair<unsigned, unsigned> >& locals);
104 void breakCriticalEdges(MachineFunction &Fn);
108 char StrongPHIElimination::ID = 0;
109 RegisterPass<StrongPHIElimination> X("strong-phi-node-elimination",
110 "Eliminate PHI nodes for register allocation, intelligently");
113 const PassInfo *llvm::StrongPHIEliminationID = X.getPassInfo();
115 /// computeDFS - Computes the DFS-in and DFS-out numbers of the dominator tree
116 /// of the given MachineFunction. These numbers are then used in other parts
117 /// of the PHI elimination process.
118 void StrongPHIElimination::computeDFS(MachineFunction& MF) {
119 SmallPtrSet<MachineDomTreeNode*, 8> frontier;
120 SmallPtrSet<MachineDomTreeNode*, 8> visited;
124 MachineDominatorTree& DT = getAnalysis<MachineDominatorTree>();
126 MachineDomTreeNode* node = DT.getRootNode();
128 std::vector<MachineDomTreeNode*> worklist;
129 worklist.push_back(node);
131 while (!worklist.empty()) {
132 MachineDomTreeNode* currNode = worklist.back();
134 if (!frontier.count(currNode)) {
135 frontier.insert(currNode);
137 preorder.insert(std::make_pair(currNode->getBlock(), time));
140 bool inserted = false;
141 for (MachineDomTreeNode::iterator I = node->begin(), E = node->end();
143 if (!frontier.count(*I) && !visited.count(*I)) {
144 worklist.push_back(*I);
150 frontier.erase(currNode);
151 visited.insert(currNode);
152 maxpreorder.insert(std::make_pair(currNode->getBlock(), time));
159 /// PreorderSorter - a helper class that is used to sort registers
160 /// according to the preorder number of their defining blocks
161 class PreorderSorter {
163 DenseMap<MachineBasicBlock*, unsigned>& preorder;
167 PreorderSorter(DenseMap<MachineBasicBlock*, unsigned>& p,
168 LiveVariables& L) : preorder(p), LV(L) { }
170 bool operator()(unsigned A, unsigned B) {
174 MachineBasicBlock* ABlock = LV.getVarInfo(A).DefInst->getParent();
175 MachineBasicBlock* BBlock = LV.getVarInfo(A).DefInst->getParent();
177 if (preorder[ABlock] < preorder[BBlock])
179 else if (preorder[ABlock] > preorder[BBlock])
182 assert(0 && "Error sorting by dominance!");
187 /// computeDomForest - compute the subforest of the DomTree corresponding
188 /// to the defining blocks of the registers in question
189 std::vector<StrongPHIElimination::DomForestNode*>
190 StrongPHIElimination::computeDomForest(std::set<unsigned>& regs) {
191 LiveVariables& LV = getAnalysis<LiveVariables>();
193 DomForestNode* VirtualRoot = new DomForestNode(0, 0);
194 maxpreorder.insert(std::make_pair((MachineBasicBlock*)0, ~0UL));
196 std::vector<unsigned> worklist;
197 worklist.reserve(regs.size());
198 for (std::set<unsigned>::iterator I = regs.begin(), E = regs.end();
200 worklist.push_back(*I);
202 PreorderSorter PS(preorder, LV);
203 std::sort(worklist.begin(), worklist.end(), PS);
205 DomForestNode* CurrentParent = VirtualRoot;
206 std::vector<DomForestNode*> stack;
207 stack.push_back(VirtualRoot);
209 for (std::vector<unsigned>::iterator I = worklist.begin(), E = worklist.end();
211 unsigned pre = preorder[LV.getVarInfo(*I).DefInst->getParent()];
212 MachineBasicBlock* parentBlock =
213 LV.getVarInfo(CurrentParent->getReg()).DefInst->getParent();
215 while (pre > maxpreorder[parentBlock]) {
217 CurrentParent = stack.back();
219 parentBlock = LV.getVarInfo(CurrentParent->getReg()).DefInst->getParent();
222 DomForestNode* child = new DomForestNode(*I, CurrentParent);
223 stack.push_back(child);
224 CurrentParent = child;
227 std::vector<DomForestNode*> ret;
228 ret.insert(ret.end(), VirtualRoot->begin(), VirtualRoot->end());
232 /// isLiveIn - helper method that determines, from a VarInfo, if a register
233 /// is live into a block
234 bool isLiveIn(LiveVariables::VarInfo& V, MachineBasicBlock* MBB) {
235 if (V.AliveBlocks.test(MBB->getNumber()))
238 if (V.DefInst->getParent() != MBB &&
239 V.UsedBlocks.test(MBB->getNumber()))
245 /// isLiveOut - help method that determines, from a VarInfo, if a register is
246 /// live out of a block.
247 bool isLiveOut(LiveVariables::VarInfo& V, MachineBasicBlock* MBB) {
248 if (MBB == V.DefInst->getParent() ||
249 V.UsedBlocks.test(MBB->getNumber())) {
250 for (std::vector<MachineInstr*>::iterator I = V.Kills.begin(),
251 E = V.Kills.end(); I != E; ++I)
252 if ((*I)->getParent() == MBB)
261 /// processBlock - Eliminate PHIs in the given block
262 void StrongPHIElimination::processBlock(MachineBasicBlock* MBB) {
263 LiveVariables& LV = getAnalysis<LiveVariables>();
265 // Holds names that have been added to a set in any PHI within this block
266 // before the current one.
267 std::set<unsigned> ProcessedNames;
269 MachineBasicBlock::iterator P = MBB->begin();
270 while (P->getOpcode() == TargetInstrInfo::PHI) {
271 LiveVariables::VarInfo& PHIInfo = LV.getVarInfo(P->getOperand(0).getReg());
273 unsigned DestReg = P->getOperand(0).getReg();
275 // Hold the names that are currently in the candidate set.
276 std::set<unsigned> PHIUnion;
277 std::set<MachineBasicBlock*> UnionedBlocks;
279 for (int i = P->getNumOperands() - 1; i >= 2; i-=2) {
280 unsigned SrcReg = P->getOperand(i-1).getReg();
281 LiveVariables::VarInfo& SrcInfo = LV.getVarInfo(SrcReg);
283 // Check for trivial interferences
284 if (isLiveIn(SrcInfo, P->getParent()) ||
285 isLiveOut(PHIInfo, SrcInfo.DefInst->getParent()) ||
286 ( PHIInfo.DefInst->getOpcode() == TargetInstrInfo::PHI &&
287 isLiveIn(PHIInfo, SrcInfo.DefInst->getParent()) ) ||
288 ProcessedNames.count(SrcReg) ||
289 UnionedBlocks.count(SrcInfo.DefInst->getParent())) {
291 // add a copy from a_i to p in Waiting[From[a_i]]
292 MachineBasicBlock* From = P->getOperand(i).getMachineBasicBlock();
293 Waiting[From].push_back(std::make_pair(SrcReg, DestReg));
295 PHIUnion.insert(SrcReg);
296 UnionedBlocks.insert(SrcInfo.DefInst->getParent());
300 std::vector<StrongPHIElimination::DomForestNode*> DF =
301 computeDomForest(PHIUnion);
303 // Walk DomForest to resolve interferences
304 std::vector<std::pair<unsigned, unsigned> > localInterferences;
305 processPHIUnion(P, PHIUnion, DF, localInterferences);
307 // FIXME: Check for local interferences
309 ProcessedNames.insert(PHIUnion.begin(), PHIUnion.end());
314 void StrongPHIElimination::processPHIUnion(MachineInstr* Inst,
315 std::set<unsigned>& PHIUnion,
316 std::vector<StrongPHIElimination::DomForestNode*>& DF,
317 std::vector<std::pair<unsigned, unsigned> >& locals) {
319 std::vector<DomForestNode*> worklist(DF.begin(), DF.end());
320 SmallPtrSet<DomForestNode*, 4> visited;
322 LiveVariables& LV = getAnalysis<LiveVariables>();
323 unsigned DestReg = Inst->getOperand(0).getReg();
325 while (!worklist.empty()) {
326 DomForestNode* DFNode = worklist.back();
328 LiveVariables::VarInfo& Info = LV.getVarInfo(DFNode->getReg());
329 visited.insert(DFNode);
331 bool inserted = false;
332 for (DomForestNode::iterator CI = DFNode->begin(), CE = DFNode->end();
334 DomForestNode* child = *CI;
335 LiveVariables::VarInfo& CInfo = LV.getVarInfo(child->getReg());
337 if (isLiveOut(Info, CInfo.DefInst->getParent())) {
338 // Insert copies for parent
339 for (int i = Inst->getNumOperands() - 1; i >= 2; i-=2) {
340 if (Inst->getOperand(i-1).getReg() == DFNode->getReg()) {
341 unsigned SrcReg = DFNode->getReg();
342 MachineBasicBlock* From = Inst->getOperand(i).getMBB();
344 Waiting[From].push_back(std::make_pair(SrcReg, DestReg));
345 PHIUnion.erase(SrcReg);
348 } else if (isLiveIn(Info, CInfo.DefInst->getParent()) ||
349 Info.DefInst->getParent() == CInfo.DefInst->getParent()) {
350 // Add (p, c) to possible local interferences
351 locals.push_back(std::make_pair(DFNode->getReg(), child->getReg()));
354 if (!visited.count(child)) {
355 worklist.push_back(child);
360 if (!inserted) worklist.pop_back();
364 /// breakCriticalEdges - Break critical edges coming into blocks with PHI
365 /// nodes, preserving dominator and livevariable info.
366 void StrongPHIElimination::breakCriticalEdges(MachineFunction &Fn) {
367 typedef std::pair<MachineBasicBlock*, MachineBasicBlock*> MBB_pair;
369 MachineDominatorTree& MDT = getAnalysis<MachineDominatorTree>();
370 LiveVariables& LV = getAnalysis<LiveVariables>();
372 // Find critical edges
373 std::vector<MBB_pair> criticals;
374 for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
376 I->begin()->getOpcode() == TargetInstrInfo::PHI &&
378 for (MachineBasicBlock::pred_iterator PI = I->pred_begin(),
379 PE = I->pred_end(); PI != PE; ++PI)
380 if ((*PI)->succ_size() > 1)
381 criticals.push_back(std::make_pair(*PI, I));
383 for (std::vector<MBB_pair>::iterator I = criticals.begin(),
384 E = criticals.end(); I != E; ++I) {
386 MachineBasicBlock* new_bb = SplitCriticalMachineEdge(I->first, I->second);
389 MDT.splitBlock(I->first);
391 // Update livevariables
392 for (unsigned var = 1024; var < Fn.getSSARegMap()->getLastVirtReg(); ++var)
393 if (isLiveOut(LV.getVarInfo(var), I->first))
394 LV.getVarInfo(var).AliveBlocks.set(new_bb->getNumber());
398 bool StrongPHIElimination::runOnMachineFunction(MachineFunction &Fn) {
399 breakCriticalEdges(Fn);
402 for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
404 I->begin()->getOpcode() == TargetInstrInfo::PHI)