blob: b0b71ce2bc5ed7a4620a06da179bbd42902f0712 [file] [log] [blame]
Lang Hamesfae02a22009-07-21 23:47:33 +00001//===-- lib/CodeGen/PHIElimination.h ----------------------------*- C++ -*-===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10#ifndef LLVM_CODEGEN_PHIELIMINATION_HPP
11#define LLVM_CODEGEN_PHIELIMINATION_HPP
12
Lang Hames287b8b02009-07-23 04:34:03 +000013#include "llvm/ADT/DenseMap.h"
14#include "llvm/ADT/SmallSet.h"
Lang Hamesfae02a22009-07-21 23:47:33 +000015#include "llvm/ADT/SmallPtrSet.h"
16#include "llvm/CodeGen/MachineFunctionPass.h"
17#include "llvm/Target/TargetInstrInfo.h"
18
19#include <map>
20
21namespace llvm {
22
23 /// Lower PHI instructions to copies.
24 class PHIElimination : public MachineFunctionPass {
25 MachineRegisterInfo *MRI; // Machine register information
Lang Hames287b8b02009-07-23 04:34:03 +000026 private:
27
28 typedef SmallSet<MachineBasicBlock*, 4> PHIKillList;
29 typedef DenseMap<unsigned, PHIKillList> PHIKillMap;
30 typedef DenseMap<unsigned, MachineBasicBlock*> PHIDefMap;
Lang Hamesfae02a22009-07-21 23:47:33 +000031
32 public:
Lang Hames287b8b02009-07-23 04:34:03 +000033
34 typedef PHIKillList::iterator phi_kill_iterator;
35 typedef PHIKillList::const_iterator const_phi_kill_iterator;
36
Lang Hamesfae02a22009-07-21 23:47:33 +000037 static char ID; // Pass identification, replacement for typeid
38 PHIElimination() : MachineFunctionPass(&ID) {}
39
40 virtual bool runOnMachineFunction(MachineFunction &Fn);
41
42 virtual void getAnalysisUsage(AnalysisUsage &AU) const;
43
Lang Hames287b8b02009-07-23 04:34:03 +000044 /// Return true if the given vreg was defined by a PHI intsr prior to
45 /// lowering.
46 bool hasPHIDef(unsigned vreg) const {
47 return PHIDefs.count(vreg);
48 }
49
50 /// Returns the block in which the PHI instruction which defined the
51 /// given vreg used to reside.
52 MachineBasicBlock* getPHIDefBlock(unsigned vreg) {
53 PHIDefMap::iterator phiDefItr = PHIDefs.find(vreg);
54 assert(phiDefItr != PHIDefs.end() && "vreg has no phi-def.");
55 return phiDefItr->second;
56 }
57
58 /// Returns true if the given vreg was killed by a PHI instr.
59 bool hasPHIKills(unsigned vreg) const {
60 return PHIKills.count(vreg);
61 }
62
63 /// Returns an iterator over the BasicBlocks which contained PHI
64 /// kills of this register prior to lowering.
65 phi_kill_iterator phiKillsBegin(unsigned vreg) {
66 PHIKillMap::iterator phiKillItr = PHIKills.find(vreg);
67 assert(phiKillItr != PHIKills.end() && "vreg has no phi-kills.");
68 return phiKillItr->second.begin();
69 }
70 phi_kill_iterator phiKillsEnd(unsigned vreg) {
71 PHIKillMap::iterator phiKillItr = PHIKills.find(vreg);
72 assert(phiKillItr != PHIKills.end() && "vreg has no phi-kills.");
73 return phiKillItr->second.end();
74 }
75
Lang Hamesfae02a22009-07-21 23:47:33 +000076 private:
77 /// EliminatePHINodes - Eliminate phi nodes by inserting copy instructions
78 /// in predecessor basic blocks.
79 ///
80 bool EliminatePHINodes(MachineFunction &MF, MachineBasicBlock &MBB);
81 void LowerAtomicPHINode(MachineBasicBlock &MBB,
82 MachineBasicBlock::iterator AfterPHIsIt);
83
84 /// analyzePHINodes - Gather information about the PHI nodes in
85 /// here. In particular, we want to map the number of uses of a virtual
86 /// register which is used in a PHI node. We map that to the BB the
87 /// vreg is coming from. This is used later to determine when the vreg
88 /// is killed in the BB.
89 ///
90 void analyzePHINodes(const MachineFunction& Fn);
91
Jakob Stoklund Olesenf235f132009-11-10 22:01:05 +000092 /// Split critical edges where necessary for good coalescer performance.
Jakob Stoklund Olesen0257dd32009-11-18 18:01:35 +000093 bool SplitPHIEdges(MachineFunction &MF, MachineBasicBlock &MBB,
94 LiveVariables &LV);
Jakob Stoklund Olesenf235f132009-11-10 22:01:05 +000095
Jakob Stoklund Olesenf235f132009-11-10 22:01:05 +000096 /// SplitCriticalEdge - Split a critical edge from A to B by
97 /// inserting a new MBB. Update branches in A and PHI instructions
98 /// in B. Return the new block.
99 MachineBasicBlock *SplitCriticalEdge(MachineBasicBlock *A,
100 MachineBasicBlock *B);
101
Jakob Stoklund Olesen12222872009-11-13 21:56:15 +0000102 /// FindCopyInsertPoint - Find a safe place in MBB to insert a copy from
103 /// SrcReg when following the CFG edge to SuccMBB. This needs to be after
104 /// any def of SrcReg, but before any subsequent point where control flow
105 /// might jump out of the basic block.
Lang Hamesfae02a22009-07-21 23:47:33 +0000106 MachineBasicBlock::iterator FindCopyInsertPoint(MachineBasicBlock &MBB,
Jakob Stoklund Olesen12222872009-11-13 21:56:15 +0000107 MachineBasicBlock &SuccMBB,
Lang Hamesfae02a22009-07-21 23:47:33 +0000108 unsigned SrcReg);
109
110 // SkipPHIsAndLabels - Copies need to be inserted after phi nodes and
111 // also after any exception handling labels: in landing pads execution
112 // starts at the label, so any copies placed before it won't be executed!
113 MachineBasicBlock::iterator SkipPHIsAndLabels(MachineBasicBlock &MBB,
114 MachineBasicBlock::iterator I) {
115 // Rather than assuming that EH labels come before other kinds of labels,
116 // just skip all labels.
117 while (I != MBB.end() &&
118 (I->getOpcode() == TargetInstrInfo::PHI || I->isLabel()))
119 ++I;
120 return I;
121 }
122
123 typedef std::pair<const MachineBasicBlock*, unsigned> BBVRegPair;
124 typedef std::map<BBVRegPair, unsigned> VRegPHIUse;
125
126 VRegPHIUse VRegPHIUseCount;
Lang Hames287b8b02009-07-23 04:34:03 +0000127 PHIDefMap PHIDefs;
128 PHIKillMap PHIKills;
Lang Hamesfae02a22009-07-21 23:47:33 +0000129
130 // Defs of PHI sources which are implicit_def.
131 SmallPtrSet<MachineInstr*, 4> ImpDefs;
132 };
133
134}
135
Evan Chenge9390912009-09-04 07:46:30 +0000136#endif /* LLVM_CODEGEN_PHIELIMINATION_HPP */