1 //===- StrongPhiElimination.cpp - Eliminate PHI nodes by inserting copies -===//
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 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/LiveIntervalAnalysis.h"
25 #include "llvm/CodeGen/MachineDominators.h"
26 #include "llvm/CodeGen/MachineFunctionPass.h"
27 #include "llvm/CodeGen/MachineInstr.h"
28 #include "llvm/CodeGen/MachineLoopInfo.h"
29 #include "llvm/CodeGen/MachineRegisterInfo.h"
30 #include "llvm/CodeGen/RegisterCoalescer.h"
31 #include "llvm/Target/TargetInstrInfo.h"
32 #include "llvm/Target/TargetMachine.h"
33 #include "llvm/ADT/DepthFirstIterator.h"
34 #include "llvm/ADT/Statistic.h"
35 #include "llvm/Support/Compiler.h"
39 struct VISIBILITY_HIDDEN StrongPHIElimination : public MachineFunctionPass {
40 static char ID; // Pass identification, replacement for typeid
41 StrongPHIElimination() : MachineFunctionPass((intptr_t)&ID) {}
43 // Waiting stores, for each MBB, the set of copies that need to
44 // be inserted into that MBB
45 DenseMap<MachineBasicBlock*,
46 std::map<unsigned, unsigned> > Waiting;
48 // Stacks holds the renaming stack for each register
49 std::map<unsigned, std::vector<unsigned> > Stacks;
51 // Registers in UsedByAnother are PHI nodes that are themselves
52 // used as operands to another another PHI node
53 std::set<unsigned> UsedByAnother;
55 // RenameSets are the is a map from a PHI-defined register
56 // to the input registers to be coalesced along with the
57 // predecessor block for those input registers.
58 std::map<unsigned, std::map<unsigned, MachineBasicBlock*> > RenameSets;
60 // PhiValueNumber holds the ID numbers of the VNs for each phi that we're
61 // eliminating, indexed by the register defined by that phi.
62 std::map<unsigned, unsigned> PhiValueNumber;
64 // Store the DFS-in number of each block
65 DenseMap<MachineBasicBlock*, unsigned> preorder;
67 // Store the DFS-out number of each block
68 DenseMap<MachineBasicBlock*, unsigned> maxpreorder;
70 bool runOnMachineFunction(MachineFunction &Fn);
72 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
73 AU.addRequired<MachineDominatorTree>();
74 AU.addRequired<LiveIntervals>();
76 // TODO: Actually make this true.
77 AU.addPreserved<LiveIntervals>();
78 AU.addPreserved<RegisterCoalescer>();
79 MachineFunctionPass::getAnalysisUsage(AU);
82 virtual void releaseMemory() {
88 UsedByAnother.clear();
94 /// DomForestNode - Represents a node in the "dominator forest". This is
95 /// a forest in which the nodes represent registers and the edges
96 /// represent a dominance relation in the block defining those registers.
97 struct DomForestNode {
99 // Store references to our children
100 std::vector<DomForestNode*> children;
101 // The register we represent
104 // Add another node as our child
105 void addChild(DomForestNode* DFN) { children.push_back(DFN); }
108 typedef std::vector<DomForestNode*>::iterator iterator;
110 // Create a DomForestNode by providing the register it represents, and
111 // the node to be its parent. The virtual root node has register 0
112 // and a null parent.
113 DomForestNode(unsigned r, DomForestNode* parent) : reg(r) {
115 parent->addChild(this);
119 for (iterator I = begin(), E = end(); I != E; ++I)
123 /// getReg - Return the regiser that this node represents
124 inline unsigned getReg() { return reg; }
126 // Provide iterator access to our children
127 inline DomForestNode::iterator begin() { return children.begin(); }
128 inline DomForestNode::iterator end() { return children.end(); }
131 void computeDFS(MachineFunction& MF);
132 void processBlock(MachineBasicBlock* MBB);
134 std::vector<DomForestNode*> computeDomForest(
135 std::map<unsigned, MachineBasicBlock*>& instrs,
136 MachineRegisterInfo& MRI);
137 void processPHIUnion(MachineInstr* Inst,
138 std::map<unsigned, MachineBasicBlock*>& PHIUnion,
139 std::vector<StrongPHIElimination::DomForestNode*>& DF,
140 std::vector<std::pair<unsigned, unsigned> >& locals);
141 void ScheduleCopies(MachineBasicBlock* MBB, std::set<unsigned>& pushed);
142 void InsertCopies(MachineBasicBlock* MBB,
143 SmallPtrSet<MachineBasicBlock*, 16>& v);
144 void mergeLiveIntervals(unsigned primary, unsigned secondary,
145 MachineBasicBlock* pred);
149 char StrongPHIElimination::ID = 0;
150 static RegisterPass<StrongPHIElimination>
151 X("strong-phi-node-elimination",
152 "Eliminate PHI nodes for register allocation, intelligently");
154 const PassInfo *const llvm::StrongPHIEliminationID = &X;
156 /// computeDFS - Computes the DFS-in and DFS-out numbers of the dominator tree
157 /// of the given MachineFunction. These numbers are then used in other parts
158 /// of the PHI elimination process.
159 void StrongPHIElimination::computeDFS(MachineFunction& MF) {
160 SmallPtrSet<MachineDomTreeNode*, 8> frontier;
161 SmallPtrSet<MachineDomTreeNode*, 8> visited;
165 MachineDominatorTree& DT = getAnalysis<MachineDominatorTree>();
167 MachineDomTreeNode* node = DT.getRootNode();
169 std::vector<MachineDomTreeNode*> worklist;
170 worklist.push_back(node);
172 while (!worklist.empty()) {
173 MachineDomTreeNode* currNode = worklist.back();
175 if (!frontier.count(currNode)) {
176 frontier.insert(currNode);
178 preorder.insert(std::make_pair(currNode->getBlock(), time));
181 bool inserted = false;
182 for (MachineDomTreeNode::iterator I = currNode->begin(), E = currNode->end();
184 if (!frontier.count(*I) && !visited.count(*I)) {
185 worklist.push_back(*I);
191 frontier.erase(currNode);
192 visited.insert(currNode);
193 maxpreorder.insert(std::make_pair(currNode->getBlock(), time));
202 /// PreorderSorter - a helper class that is used to sort registers
203 /// according to the preorder number of their defining blocks
204 class PreorderSorter {
206 DenseMap<MachineBasicBlock*, unsigned>& preorder;
207 MachineRegisterInfo& MRI;
210 PreorderSorter(DenseMap<MachineBasicBlock*, unsigned>& p,
211 MachineRegisterInfo& M) : preorder(p), MRI(M) { }
213 bool operator()(unsigned A, unsigned B) {
217 MachineBasicBlock* ABlock = MRI.getVRegDef(A)->getParent();
218 MachineBasicBlock* BBlock = MRI.getVRegDef(B)->getParent();
220 if (preorder[ABlock] < preorder[BBlock])
222 else if (preorder[ABlock] > preorder[BBlock])
231 /// computeDomForest - compute the subforest of the DomTree corresponding
232 /// to the defining blocks of the registers in question
233 std::vector<StrongPHIElimination::DomForestNode*>
234 StrongPHIElimination::computeDomForest(
235 std::map<unsigned, MachineBasicBlock*>& regs,
236 MachineRegisterInfo& MRI) {
237 // Begin by creating a virtual root node, since the actual results
238 // may well be a forest. Assume this node has maximum DFS-out number.
239 DomForestNode* VirtualRoot = new DomForestNode(0, 0);
240 maxpreorder.insert(std::make_pair((MachineBasicBlock*)0, ~0UL));
242 // Populate a worklist with the registers
243 std::vector<unsigned> worklist;
244 worklist.reserve(regs.size());
245 for (std::map<unsigned, MachineBasicBlock*>::iterator I = regs.begin(),
246 E = regs.end(); I != E; ++I)
247 worklist.push_back(I->first);
249 // Sort the registers by the DFS-in number of their defining block
250 PreorderSorter PS(preorder, MRI);
251 std::sort(worklist.begin(), worklist.end(), PS);
253 // Create a "current parent" stack, and put the virtual root on top of it
254 DomForestNode* CurrentParent = VirtualRoot;
255 std::vector<DomForestNode*> stack;
256 stack.push_back(VirtualRoot);
258 // Iterate over all the registers in the previously computed order
259 for (std::vector<unsigned>::iterator I = worklist.begin(), E = worklist.end();
261 unsigned pre = preorder[MRI.getVRegDef(*I)->getParent()];
262 MachineBasicBlock* parentBlock = CurrentParent->getReg() ?
263 MRI.getVRegDef(CurrentParent->getReg())->getParent() :
266 // If the DFS-in number of the register is greater than the DFS-out number
267 // of the current parent, repeatedly pop the parent stack until it isn't.
268 while (pre > maxpreorder[parentBlock]) {
270 CurrentParent = stack.back();
272 parentBlock = CurrentParent->getReg() ?
273 MRI.getVRegDef(CurrentParent->getReg())->getParent() :
277 // Now that we've found the appropriate parent, create a DomForestNode for
278 // this register and attach it to the forest
279 DomForestNode* child = new DomForestNode(*I, CurrentParent);
281 // Push this new node on the "current parent" stack
282 stack.push_back(child);
283 CurrentParent = child;
286 // Return a vector containing the children of the virtual root node
287 std::vector<DomForestNode*> ret;
288 ret.insert(ret.end(), VirtualRoot->begin(), VirtualRoot->end());
292 /// isLiveIn - helper method that determines, from a regno, if a register
293 /// is live into a block
294 static bool isLiveIn(unsigned r, MachineBasicBlock* MBB,
296 LiveInterval& I = LI.getOrCreateInterval(r);
297 unsigned idx = LI.getMBBStartIdx(MBB);
298 return I.liveBeforeAndAt(idx);
301 /// isLiveOut - help method that determines, from a regno, if a register is
302 /// live out of a block.
303 static bool isLiveOut(unsigned r, MachineBasicBlock* MBB,
305 for (MachineBasicBlock::succ_iterator PI = MBB->succ_begin(),
306 E = MBB->succ_end(); PI != E; ++PI) {
307 if (isLiveIn(r, *PI, LI))
314 /// interferes - checks for local interferences by scanning a block. The only
315 /// trick parameter is 'mode' which tells it the relationship of the two
316 /// registers. 0 - defined in the same block, 1 - first properly dominates
317 /// second, 2 - second properly dominates first
318 static bool interferes(unsigned a, unsigned b, MachineBasicBlock* scan,
319 LiveIntervals& LV, unsigned mode) {
320 MachineInstr* def = 0;
321 MachineInstr* kill = 0;
323 // The code is still in SSA form at this point, so there is only one
324 // definition per VReg. Thus we can safely use MRI->getVRegDef().
325 const MachineRegisterInfo* MRI = &scan->getParent()->getRegInfo();
327 bool interference = false;
329 // Wallk the block, checking for interferences
330 for (MachineBasicBlock::iterator MBI = scan->begin(), MBE = scan->end();
332 MachineInstr* curr = MBI;
334 // Same defining block...
336 if (curr == MRI->getVRegDef(a)) {
337 // If we find our first definition, save it
340 // If there's already an unkilled definition, then
341 // this is an interference
345 // If there's a definition followed by a KillInst, then
346 // they can't interfere
348 interference = false;
351 // Symmetric with the above
352 } else if (curr == MRI->getVRegDef(b)) {
359 interference = false;
362 // Store KillInsts if they match up with the definition
363 } else if (curr->killsRegister(a)) {
364 if (def == MRI->getVRegDef(a)) {
366 } else if (curr->killsRegister(b)) {
367 if (def == MRI->getVRegDef(b)) {
372 // First properly dominates second...
373 } else if (mode == 1) {
374 if (curr == MRI->getVRegDef(b)) {
375 // Definition of second without kill of first is an interference
379 // Definition after a kill is a non-interference
381 interference = false;
384 // Save KillInsts of First
385 } else if (curr->killsRegister(a)) {
388 // Symmetric with the above
389 } else if (mode == 2) {
390 if (curr == MRI->getVRegDef(a)) {
395 interference = false;
398 } else if (curr->killsRegister(b)) {
407 /// processBlock - Determine how to break up PHIs in the current block. Each
408 /// PHI is broken up by some combination of renaming its operands and inserting
409 /// copies. This method is responsible for determining which operands receive
411 void StrongPHIElimination::processBlock(MachineBasicBlock* MBB) {
412 LiveIntervals& LI = getAnalysis<LiveIntervals>();
413 MachineRegisterInfo& MRI = MBB->getParent()->getRegInfo();
415 // Holds names that have been added to a set in any PHI within this block
416 // before the current one.
417 std::set<unsigned> ProcessedNames;
419 // Iterate over all the PHI nodes in this block
420 MachineBasicBlock::iterator P = MBB->begin();
421 while (P != MBB->end() && P->getOpcode() == TargetInstrInfo::PHI) {
422 unsigned DestReg = P->getOperand(0).getReg();
424 // Don't both doing PHI elimination for dead PHI's.
425 if (P->registerDefIsDead(DestReg)) {
430 LiveInterval& PI = LI.getOrCreateInterval(DestReg);
431 unsigned pIdx = LI.getDefIndex(LI.getInstructionIndex(P));
432 VNInfo* PVN = PI.getLiveRangeContaining(pIdx)->valno;
433 PhiValueNumber.insert(std::make_pair(DestReg, PVN->id));
435 // PHIUnion is the set of incoming registers to the PHI node that
436 // are going to be renames rather than having copies inserted. This set
437 // is refinded over the course of this function. UnionedBlocks is the set
438 // of corresponding MBBs.
439 std::map<unsigned, MachineBasicBlock*> PHIUnion;
440 SmallPtrSet<MachineBasicBlock*, 8> UnionedBlocks;
442 // Iterate over the operands of the PHI node
443 for (int i = P->getNumOperands() - 1; i >= 2; i-=2) {
444 unsigned SrcReg = P->getOperand(i-1).getReg();
446 // Check for trivial interferences via liveness information, allowing us
447 // to avoid extra work later. Any registers that interfere cannot both
448 // be in the renaming set, so choose one and add copies for it instead.
449 // The conditions are:
450 // 1) if the operand is live into the PHI node's block OR
451 // 2) if the PHI node is live out of the operand's defining block OR
452 // 3) if the operand is itself a PHI node and the original PHI is
453 // live into the operand's defining block OR
454 // 4) if the operand is already being renamed for another PHI node
456 // 5) if any two operands are defined in the same block, insert copies
458 if (isLiveIn(SrcReg, P->getParent(), LI) ||
459 isLiveOut(P->getOperand(0).getReg(),
460 MRI.getVRegDef(SrcReg)->getParent(), LI) ||
461 ( MRI.getVRegDef(SrcReg)->getOpcode() == TargetInstrInfo::PHI &&
462 isLiveIn(P->getOperand(0).getReg(),
463 MRI.getVRegDef(SrcReg)->getParent(), LI) ) ||
464 ProcessedNames.count(SrcReg) ||
465 UnionedBlocks.count(MRI.getVRegDef(SrcReg)->getParent())) {
467 // Add a copy for the selected register
468 MachineBasicBlock* From = P->getOperand(i).getMBB();
469 Waiting[From].insert(std::make_pair(SrcReg, DestReg));
470 UsedByAnother.insert(SrcReg);
472 // Otherwise, add it to the renaming set
473 PHIUnion.insert(std::make_pair(SrcReg,P->getOperand(i).getMBB()));
474 UnionedBlocks.insert(MRI.getVRegDef(SrcReg)->getParent());
478 // Compute the dominator forest for the renaming set. This is a forest
479 // where the nodes are the registers and the edges represent dominance
480 // relations between the defining blocks of the registers
481 std::vector<StrongPHIElimination::DomForestNode*> DF =
482 computeDomForest(PHIUnion, MRI);
484 // Walk DomForest to resolve interferences at an inter-block level. This
485 // will remove registers from the renaming set (and insert copies for them)
486 // if interferences are found.
487 std::vector<std::pair<unsigned, unsigned> > localInterferences;
488 processPHIUnion(P, PHIUnion, DF, localInterferences);
490 // If one of the inputs is defined in the same block as the current PHI
491 // then we need to check for a local interference between that input and
493 for (std::map<unsigned, MachineBasicBlock*>::iterator I = PHIUnion.begin(),
494 E = PHIUnion.end(); I != E; ++I)
495 if (MRI.getVRegDef(I->first)->getParent() == P->getParent())
496 localInterferences.push_back(std::make_pair(I->first,
497 P->getOperand(0).getReg()));
499 // The dominator forest walk may have returned some register pairs whose
500 // interference cannot be determined from dominator analysis. We now
501 // examine these pairs for local interferences.
502 for (std::vector<std::pair<unsigned, unsigned> >::iterator I =
503 localInterferences.begin(), E = localInterferences.end(); I != E; ++I) {
504 std::pair<unsigned, unsigned> p = *I;
506 MachineDominatorTree& MDT = getAnalysis<MachineDominatorTree>();
508 // Determine the block we need to scan and the relationship between
510 MachineBasicBlock* scan = 0;
512 if (MRI.getVRegDef(p.first)->getParent() ==
513 MRI.getVRegDef(p.second)->getParent()) {
514 scan = MRI.getVRegDef(p.first)->getParent();
515 mode = 0; // Same block
516 } else if (MDT.dominates(MRI.getVRegDef(p.first)->getParent(),
517 MRI.getVRegDef(p.second)->getParent())) {
518 scan = MRI.getVRegDef(p.second)->getParent();
519 mode = 1; // First dominates second
521 scan = MRI.getVRegDef(p.first)->getParent();
522 mode = 2; // Second dominates first
525 // If there's an interference, we need to insert copies
526 if (interferes(p.first, p.second, scan, LI, mode)) {
527 // Insert copies for First
528 for (int i = P->getNumOperands() - 1; i >= 2; i-=2) {
529 if (P->getOperand(i-1).getReg() == p.first) {
530 unsigned SrcReg = p.first;
531 MachineBasicBlock* From = P->getOperand(i).getMBB();
533 Waiting[From].insert(std::make_pair(SrcReg,
534 P->getOperand(0).getReg()));
535 UsedByAnother.insert(SrcReg);
537 PHIUnion.erase(SrcReg);
543 // Add the renaming set for this PHI node to our overall renaming information
544 RenameSets.insert(std::make_pair(P->getOperand(0).getReg(), PHIUnion));
546 // Remember which registers are already renamed, so that we don't try to
547 // rename them for another PHI node in this block
548 for (std::map<unsigned, MachineBasicBlock*>::iterator I = PHIUnion.begin(),
549 E = PHIUnion.end(); I != E; ++I)
550 ProcessedNames.insert(I->first);
556 /// processPHIUnion - Take a set of candidate registers to be coalesced when
557 /// decomposing the PHI instruction. Use the DominanceForest to remove the ones
558 /// that are known to interfere, and flag others that need to be checked for
559 /// local interferences.
560 void StrongPHIElimination::processPHIUnion(MachineInstr* Inst,
561 std::map<unsigned, MachineBasicBlock*>& PHIUnion,
562 std::vector<StrongPHIElimination::DomForestNode*>& DF,
563 std::vector<std::pair<unsigned, unsigned> >& locals) {
565 std::vector<DomForestNode*> worklist(DF.begin(), DF.end());
566 SmallPtrSet<DomForestNode*, 4> visited;
568 // Code is still in SSA form, so we can use MRI::getVRegDef()
569 MachineRegisterInfo& MRI = Inst->getParent()->getParent()->getRegInfo();
571 LiveIntervals& LI = getAnalysis<LiveIntervals>();
572 unsigned DestReg = Inst->getOperand(0).getReg();
574 // DF walk on the DomForest
575 while (!worklist.empty()) {
576 DomForestNode* DFNode = worklist.back();
578 visited.insert(DFNode);
580 bool inserted = false;
581 for (DomForestNode::iterator CI = DFNode->begin(), CE = DFNode->end();
583 DomForestNode* child = *CI;
585 // If the current node is live-out of the defining block of one of its
586 // children, insert a copy for it. NOTE: The paper actually calls for
587 // a more elaborate heuristic for determining whether to insert copies
588 // for the child or the parent. In the interest of simplicity, we're
589 // just always choosing the parent.
590 if (isLiveOut(DFNode->getReg(),
591 MRI.getVRegDef(child->getReg())->getParent(), LI)) {
592 // Insert copies for parent
593 for (int i = Inst->getNumOperands() - 1; i >= 2; i-=2) {
594 if (Inst->getOperand(i-1).getReg() == DFNode->getReg()) {
595 unsigned SrcReg = DFNode->getReg();
596 MachineBasicBlock* From = Inst->getOperand(i).getMBB();
598 Waiting[From].insert(std::make_pair(SrcReg, DestReg));
599 UsedByAnother.insert(SrcReg);
601 PHIUnion.erase(SrcReg);
605 // If a node is live-in to the defining block of one of its children, but
606 // not live-out, then we need to scan that block for local interferences.
607 } else if (isLiveIn(DFNode->getReg(),
608 MRI.getVRegDef(child->getReg())->getParent(), LI) ||
609 MRI.getVRegDef(DFNode->getReg())->getParent() ==
610 MRI.getVRegDef(child->getReg())->getParent()) {
611 // Add (p, c) to possible local interferences
612 locals.push_back(std::make_pair(DFNode->getReg(), child->getReg()));
615 if (!visited.count(child)) {
616 worklist.push_back(child);
621 if (!inserted) worklist.pop_back();
625 /// ScheduleCopies - Insert copies into predecessor blocks, scheduling
626 /// them properly so as to avoid the 'lost copy' and the 'virtual swap'
629 /// Based on "Practical Improvements to the Construction and Destruction
630 /// of Static Single Assignment Form" by Briggs, et al.
631 void StrongPHIElimination::ScheduleCopies(MachineBasicBlock* MBB,
632 std::set<unsigned>& pushed) {
633 // FIXME: This function needs to update LiveIntervals
634 std::map<unsigned, unsigned>& copy_set= Waiting[MBB];
636 std::map<unsigned, unsigned> worklist;
637 std::map<unsigned, unsigned> map;
639 // Setup worklist of initial copies
640 for (std::map<unsigned, unsigned>::iterator I = copy_set.begin(),
641 E = copy_set.end(); I != E; ) {
642 map.insert(std::make_pair(I->first, I->first));
643 map.insert(std::make_pair(I->second, I->second));
645 if (!UsedByAnother.count(I->second)) {
648 // Avoid iterator invalidation
649 unsigned first = I->first;
651 copy_set.erase(first);
657 LiveIntervals& LI = getAnalysis<LiveIntervals>();
658 MachineFunction* MF = MBB->getParent();
659 MachineRegisterInfo& MRI = MF->getRegInfo();
660 const TargetInstrInfo *TII = MF->getTarget().getInstrInfo();
662 SmallVector<std::pair<unsigned, MachineInstr*>, 4> InsertedPHIDests;
664 // Iterate over the worklist, inserting copies
665 while (!worklist.empty() || !copy_set.empty()) {
666 while (!worklist.empty()) {
667 std::pair<unsigned, unsigned> curr = *worklist.begin();
668 worklist.erase(curr.first);
670 const TargetRegisterClass *RC = MF->getRegInfo().getRegClass(curr.first);
672 if (isLiveOut(curr.second, MBB, LI)) {
673 // Create a temporary
674 unsigned t = MF->getRegInfo().createVirtualRegister(RC);
676 // Insert copy from curr.second to a temporary at
677 // the Phi defining curr.second
678 MachineBasicBlock::iterator PI = MRI.getVRegDef(curr.second);
679 TII->copyRegToReg(*PI->getParent(), PI, t,
680 curr.second, RC, RC);
682 // Push temporary on Stacks
683 Stacks[curr.second].push_back(t);
685 // Insert curr.second in pushed
686 pushed.insert(curr.second);
689 // Insert copy from map[curr.first] to curr.second
690 TII->copyRegToReg(*MBB, MBB->getFirstTerminator(), curr.second,
691 map[curr.first], RC, RC);
692 map[curr.first] = curr.second;
694 // Push this copy onto InsertedPHICopies so we can
695 // update LiveIntervals with it.
696 MachineBasicBlock::iterator MI = MBB->getFirstTerminator();
697 InsertedPHIDests.push_back(std::make_pair(curr.second, --MI));
699 // If curr.first is a destination in copy_set...
700 for (std::map<unsigned, unsigned>::iterator I = copy_set.begin(),
701 E = copy_set.end(); I != E; )
702 if (curr.first == I->second) {
703 std::pair<unsigned, unsigned> temp = *I;
705 // Avoid iterator invalidation
707 copy_set.erase(temp.first);
708 worklist.insert(temp);
716 if (!copy_set.empty()) {
717 std::pair<unsigned, unsigned> curr = *copy_set.begin();
718 copy_set.erase(curr.first);
720 const TargetRegisterClass *RC = MF->getRegInfo().getRegClass(curr.first);
722 // Insert a copy from dest to a new temporary t at the end of b
723 unsigned t = MF->getRegInfo().createVirtualRegister(RC);
724 TII->copyRegToReg(*MBB, MBB->getFirstTerminator(), t,
725 curr.second, RC, RC);
726 map[curr.second] = t;
728 worklist.insert(curr);
732 // Renumber the instructions so that we can perform the index computations
733 // needed to create new live intervals.
734 LI.computeNumbering();
736 // For copies that we inserted at the ends of predecessors, we construct
737 // live intervals. This is pretty easy, since we know that the destination
738 // register cannot have be in live at that point previously. We just have
739 // to make sure that, for registers that serve as inputs to more than one
740 // PHI, we don't create multiple overlapping live intervals.
741 std::set<unsigned> RegHandled;
742 for (SmallVector<std::pair<unsigned, MachineInstr*>, 4>::iterator I =
743 InsertedPHIDests.begin(), E = InsertedPHIDests.end(); I != E; ++I)
744 if (RegHandled.insert(I->first).second)
745 LI.addLiveRangeToEndOfBlock(I->first, I->second);
748 /// InsertCopies - insert copies into MBB and all of its successors
749 void StrongPHIElimination::InsertCopies(MachineBasicBlock* MBB,
750 SmallPtrSet<MachineBasicBlock*, 16>& visited) {
753 std::set<unsigned> pushed;
755 // Rewrite register uses from Stacks
756 for (MachineBasicBlock::iterator I = MBB->begin(), E = MBB->end();
758 for (unsigned i = 0; i < I->getNumOperands(); ++i)
759 if (I->getOperand(i).isRegister() &&
760 Stacks[I->getOperand(i).getReg()].size()) {
761 I->getOperand(i).setReg(Stacks[I->getOperand(i).getReg()].back());
764 // Schedule the copies for this block
765 ScheduleCopies(MBB, pushed);
767 // Recur to our successors
768 for (GraphTraits<MachineBasicBlock*>::ChildIteratorType I =
769 GraphTraits<MachineBasicBlock*>::child_begin(MBB), E =
770 GraphTraits<MachineBasicBlock*>::child_end(MBB); I != E; ++I)
771 if (!visited.count(*I))
772 InsertCopies(*I, visited);
774 // As we exit this block, pop the names we pushed while processing it
775 for (std::set<unsigned>::iterator I = pushed.begin(),
776 E = pushed.end(); I != E; ++I)
777 Stacks[*I].pop_back();
780 void StrongPHIElimination::mergeLiveIntervals(unsigned primary,
782 MachineBasicBlock* pred) {
784 LiveIntervals& LI = getAnalysis<LiveIntervals>();
785 LiveInterval& LHS = LI.getOrCreateInterval(primary);
786 LiveInterval& RHS = LI.getOrCreateInterval(secondary);
788 LI.computeNumbering();
789 const LiveRange* RangeMergingIn =
790 RHS.getLiveRangeContaining(LI.getMBBEndIdx(pred));
791 VNInfo* RHSVN = RangeMergingIn->valno;
792 VNInfo* NewVN = LHS.getNextValue(RangeMergingIn->valno->def,
793 RangeMergingIn->valno->copy,
794 LI.getVNInfoAllocator());
796 // If we discover that a live range was defined by a two-addr
797 // instruction, we need to merge over the input as well, even if
798 // it has a different VNInfo.
799 SmallPtrSet<VNInfo*, 4> MergedVNs;
800 MergedVNs.insert(RHSVN);
802 DenseMap<VNInfo*, VNInfo*> VNMap;
803 VNMap.insert(std::make_pair(RangeMergingIn->valno, NewVN));
805 // Find all VNs that are the inputs to two-address instructiosn
806 // chaining upwards from the VN we're trying to merge.
810 unsigned defIndex = RHSVN->def;
812 if (defIndex != ~0U) {
813 MachineInstr* instr = LI.getInstructionFromIndex(defIndex);
815 for (unsigned i = 0; i < instr->getNumOperands(); ++i) {
816 if (instr->getOperand(i).isReg() &&
817 instr->getOperand(i).getReg() == secondary)
818 if (instr->isRegReDefinedByTwoAddr(secondary, i)) {
819 RHSVN = RHS.getLiveRangeContaining(defIndex-1)->valno;
822 VNInfo* NextVN = LHS.getNextValue(RHSVN->def,
824 LI.getVNInfoAllocator());
825 VNMap.insert(std::make_pair(RHSVN, NextVN));
833 // Merge VNs from RHS into LHS using the mapping we computed above.
834 for (DenseMap<VNInfo*, VNInfo*>::iterator VI = VNMap.begin(),
835 VE = VNMap.end(); VI != VE; ++VI) {
836 LHS.MergeValueInAsValue(RHS, VI->first, VI->second);
837 RHS.removeValNo(VI->first);
840 if (RHS.begin() == RHS.end())
841 LI.removeInterval(RHS.reg);
844 bool StrongPHIElimination::runOnMachineFunction(MachineFunction &Fn) {
845 LiveIntervals& LI = getAnalysis<LiveIntervals>();
847 // Compute DFS numbers of each block
850 // Determine which phi node operands need copies
851 for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
853 I->begin()->getOpcode() == TargetInstrInfo::PHI)
857 // FIXME: This process should probably preserve LiveIntervals
858 SmallPtrSet<MachineBasicBlock*, 16> visited;
859 InsertCopies(Fn.begin(), visited);
862 typedef std::map<unsigned, std::map<unsigned, MachineBasicBlock*> >
864 for (RenameSetType::iterator I = RenameSets.begin(), E = RenameSets.end();
866 for (std::map<unsigned, MachineBasicBlock*>::iterator SI =
867 I->second.begin(), SE = I->second.end(); SI != SE; ++SI) {
868 mergeLiveIntervals(I->first, SI->first, SI->second);
869 Fn.getRegInfo().replaceRegWith(SI->first, I->first);
872 // FIXME: Insert last-minute copies
875 std::vector<MachineInstr*> phis;
876 for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) {
877 for (MachineBasicBlock::iterator BI = I->begin(), BE = I->end();
879 if (BI->getOpcode() == TargetInstrInfo::PHI)
883 for (std::vector<MachineInstr*>::iterator I = phis.begin(), E = phis.end();
885 MachineInstr* PInstr = *(I++);
887 // If this is a dead PHI node, then remove it from LiveIntervals.
888 unsigned DestReg = PInstr->getOperand(0).getReg();
889 LiveInterval& PI = LI.getInterval(DestReg);
890 if (PInstr->registerDefIsDead(DestReg)) {
891 if (PI.containsOneValue()) {
892 LI.removeInterval(DestReg);
894 unsigned idx = LI.getDefIndex(LI.getInstructionIndex(PInstr));
895 PI.removeRange(*PI.getLiveRangeContaining(idx), true);
898 // Trim live intervals of input registers. They are no longer live into
899 // this block if they died after the PHI. If they lived after it, don't
900 // trim them because they might have other legitimate uses.
901 for (unsigned i = 1; i < PInstr->getNumOperands(); i += 2) {
902 unsigned reg = PInstr->getOperand(i).getReg();
903 MachineBasicBlock* MBB = PInstr->getOperand(i+1).getMBB();
904 LiveInterval& InputI = LI.getInterval(reg);
905 if (MBB != PInstr->getParent() &&
906 InputI.liveAt(LI.getMBBStartIdx(PInstr->getParent())) &&
907 InputI.expiredAt(LI.getInstructionIndex(PInstr) +
908 LiveIntervals::InstrSlots::NUM))
909 InputI.removeRange(LI.getMBBStartIdx(PInstr->getParent()),
910 LI.getInstructionIndex(PInstr),
914 // If the PHI is not dead, then the valno defined by the PHI
915 // now has an unknown def.
916 unsigned idx = LI.getDefIndex(LI.getInstructionIndex(PInstr));
917 const LiveRange* PLR = PI.getLiveRangeContaining(idx);
918 PLR->valno->def = ~0U;
919 LiveRange R (LI.getMBBStartIdx(PInstr->getParent()),
920 PLR->start, PLR->valno);
924 LI.RemoveMachineInstrFromMaps(PInstr);
925 PInstr->eraseFromParent();
928 LI.computeNumbering();