blob: 506d43e7f3fc0562a05035238d6a8ad81177699c [file] [log] [blame]
David Goodwin34877712009-10-26 19:32:42 +00001//=- llvm/CodeGen/AggressiveAntiDepBreaker.h - Anti-Dep Support -*- 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// This file implements the AggressiveAntiDepBreaker class, which
11// implements register anti-dependence breaking during post-RA
12// scheduling. It attempts to break all anti-dependencies within a
13// block.
14//
15//===----------------------------------------------------------------------===//
16
17#ifndef LLVM_CODEGEN_AGGRESSIVEANTIDEPBREAKER_H
18#define LLVM_CODEGEN_AGGRESSIVEANTIDEPBREAKER_H
19
David Goodwin82c72482009-10-28 18:29:54 +000020#include "AntiDepBreaker.h"
David Goodwin34877712009-10-26 19:32:42 +000021#include "llvm/CodeGen/MachineBasicBlock.h"
22#include "llvm/CodeGen/MachineFrameInfo.h"
23#include "llvm/CodeGen/MachineFunction.h"
24#include "llvm/CodeGen/MachineRegisterInfo.h"
25#include "llvm/CodeGen/ScheduleDAG.h"
David Goodwin0855dee2009-11-10 00:15:47 +000026#include "llvm/Target/TargetSubtarget.h"
David Goodwin34877712009-10-26 19:32:42 +000027#include "llvm/Target/TargetRegisterInfo.h"
28#include "llvm/ADT/BitVector.h"
29#include "llvm/ADT/SmallSet.h"
David Goodwin557bbe62009-11-20 19:32:48 +000030#include <map>
David Goodwin34877712009-10-26 19:32:42 +000031
32namespace llvm {
Jim Grosbach2973b572010-01-06 16:48:02 +000033 /// Class AggressiveAntiDepState
David Goodwin557bbe62009-11-20 19:32:48 +000034 /// Contains all the state necessary for anti-dep breaking.
David Goodwine10deca2009-10-26 22:31:16 +000035 class AggressiveAntiDepState {
36 public:
David Goodwin34877712009-10-26 19:32:42 +000037 /// RegisterReference - Information about a register reference
38 /// within a liverange
39 typedef struct {
40 /// Operand - The registers operand
41 MachineOperand *Operand;
42 /// RC - The register class
43 const TargetRegisterClass *RC;
44 } RegisterReference;
45
David Goodwine10deca2009-10-26 22:31:16 +000046 private:
David Goodwin990d2852009-12-09 17:18:22 +000047 /// NumTargetRegs - Number of non-virtual target registers
48 /// (i.e. TRI->getNumRegs()).
49 const unsigned NumTargetRegs;
50
David Goodwin34877712009-10-26 19:32:42 +000051 /// GroupNodes - Implements a disjoint-union data structure to
52 /// form register groups. A node is represented by an index into
53 /// the vector. A node can "point to" itself to indicate that it
54 /// is the parent of a group, or point to another node to indicate
55 /// that it is a member of the same group as that node.
56 std::vector<unsigned> GroupNodes;
Jim Grosbach2973b572010-01-06 16:48:02 +000057
David Goodwin34877712009-10-26 19:32:42 +000058 /// GroupNodeIndices - For each register, the index of the GroupNode
59 /// currently representing the group that the register belongs to.
60 /// Register 0 is always represented by the 0 group, a group
61 /// composed of registers that are not eligible for anti-aliasing.
62 unsigned GroupNodeIndices[TargetRegisterInfo::FirstVirtualRegister];
Jim Grosbach2973b572010-01-06 16:48:02 +000063
David Goodwine10deca2009-10-26 22:31:16 +000064 /// RegRefs - Map registers to all their references within a live range.
David Goodwin34877712009-10-26 19:32:42 +000065 std::multimap<unsigned, RegisterReference> RegRefs;
Jim Grosbach2973b572010-01-06 16:48:02 +000066
David Goodwin34877712009-10-26 19:32:42 +000067 /// KillIndices - The index of the most recent kill (proceding bottom-up),
68 /// or ~0u if the register is not live.
69 unsigned KillIndices[TargetRegisterInfo::FirstVirtualRegister];
Jim Grosbach2973b572010-01-06 16:48:02 +000070
David Goodwin34877712009-10-26 19:32:42 +000071 /// DefIndices - The index of the most recent complete def (proceding bottom
72 /// up), or ~0u if the register is live.
73 unsigned DefIndices[TargetRegisterInfo::FirstVirtualRegister];
74
75 public:
David Goodwin990d2852009-12-09 17:18:22 +000076 AggressiveAntiDepState(const unsigned TargetRegs, MachineBasicBlock *BB);
Jim Grosbach2973b572010-01-06 16:48:02 +000077
David Goodwine10deca2009-10-26 22:31:16 +000078 /// GetKillIndices - Return the kill indices.
79 unsigned *GetKillIndices() { return KillIndices; }
David Goodwin34877712009-10-26 19:32:42 +000080
David Goodwine10deca2009-10-26 22:31:16 +000081 /// GetDefIndices - Return the define indices.
82 unsigned *GetDefIndices() { return DefIndices; }
David Goodwin34877712009-10-26 19:32:42 +000083
David Goodwine10deca2009-10-26 22:31:16 +000084 /// GetRegRefs - Return the RegRefs map.
85 std::multimap<unsigned, RegisterReference>& GetRegRefs() { return RegRefs; }
David Goodwin34877712009-10-26 19:32:42 +000086
David Goodwin34877712009-10-26 19:32:42 +000087 // GetGroup - Get the group for a register. The returned value is
88 // the index of the GroupNode representing the group.
89 unsigned GetGroup(unsigned Reg);
Jim Grosbach2973b572010-01-06 16:48:02 +000090
David Goodwin34877712009-10-26 19:32:42 +000091 // GetGroupRegs - Return a vector of the registers belonging to a
David Goodwin87d21b92009-11-13 19:52:48 +000092 // group. If RegRefs is non-NULL then only included referenced registers.
93 void GetGroupRegs(
94 unsigned Group,
95 std::vector<unsigned> &Regs,
Jim Grosbach2973b572010-01-06 16:48:02 +000096 std::multimap<unsigned,
97 AggressiveAntiDepState::RegisterReference> *RegRefs);
David Goodwin34877712009-10-26 19:32:42 +000098
99 // UnionGroups - Union Reg1's and Reg2's groups to form a new
100 // group. Return the index of the GroupNode representing the
101 // group.
102 unsigned UnionGroups(unsigned Reg1, unsigned Reg2);
103
104 // LeaveGroup - Remove a register from its current group and place
105 // it alone in its own group. Return the index of the GroupNode
106 // representing the registers new group.
107 unsigned LeaveGroup(unsigned Reg);
108
109 /// IsLive - Return true if Reg is live
110 bool IsLive(unsigned Reg);
David Goodwine10deca2009-10-26 22:31:16 +0000111 };
112
113
Jim Grosbach2973b572010-01-06 16:48:02 +0000114 /// Class AggressiveAntiDepBreaker
David Goodwine10deca2009-10-26 22:31:16 +0000115 class AggressiveAntiDepBreaker : public AntiDepBreaker {
116 MachineFunction& MF;
117 MachineRegisterInfo &MRI;
118 const TargetRegisterInfo *TRI;
119
120 /// AllocatableSet - The set of allocatable registers.
121 /// We'll be ignoring anti-dependencies on non-allocatable registers,
122 /// because they may not be safe to break.
David Goodwin87d21b92009-11-13 19:52:48 +0000123 const BitVector AllocatableSet;
124
125 /// CriticalPathSet - The set of registers that should only be
126 /// renamed if they are on the critical path.
127 BitVector CriticalPathSet;
David Goodwine10deca2009-10-26 22:31:16 +0000128
129 /// State - The state used to identify and rename anti-dependence
130 /// registers.
131 AggressiveAntiDepState *State;
132
David Goodwine10deca2009-10-26 22:31:16 +0000133 public:
Jim Grosbach2973b572010-01-06 16:48:02 +0000134 AggressiveAntiDepBreaker(MachineFunction& MFi,
David Goodwin87d21b92009-11-13 19:52:48 +0000135 TargetSubtarget::RegClassVector& CriticalPathRCs);
David Goodwine10deca2009-10-26 22:31:16 +0000136 ~AggressiveAntiDepBreaker();
Jim Grosbach2973b572010-01-06 16:48:02 +0000137
David Goodwine10deca2009-10-26 22:31:16 +0000138 /// Start - Initialize anti-dep breaking for a new basic block.
139 void StartBlock(MachineBasicBlock *BB);
140
Jim Grosbach2973b572010-01-06 16:48:02 +0000141 /// BreakAntiDependencies - Identifiy anti-dependencies along the critical
142 /// path
David Goodwine10deca2009-10-26 22:31:16 +0000143 /// of the ScheduleDAG and break them by renaming registers.
144 ///
Dan Gohman66db3a02010-04-19 23:11:58 +0000145 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
146 MachineBasicBlock::iterator Begin,
147 MachineBasicBlock::iterator End,
David Goodwine10deca2009-10-26 22:31:16 +0000148 unsigned InsertPosIndex);
149
150 /// Observe - Update liveness information to account for the current
151 /// instruction, which will not be scheduled.
152 ///
153 void Observe(MachineInstr *MI, unsigned Count, unsigned InsertPosIndex);
154
155 /// Finish - Finish anti-dep breaking for a basic block.
156 void FinishBlock();
157
158 private:
David Goodwin54097832009-11-05 01:19:35 +0000159 typedef std::map<const TargetRegisterClass *,
160 TargetRegisterClass::const_iterator> RenameOrderType;
161
David Goodwin34877712009-10-26 19:32:42 +0000162 /// IsImplicitDefUse - Return true if MO represents a register
163 /// that is both implicitly used and defined in MI
164 bool IsImplicitDefUse(MachineInstr *MI, MachineOperand& MO);
Jim Grosbach2973b572010-01-06 16:48:02 +0000165
David Goodwin34877712009-10-26 19:32:42 +0000166 /// GetPassthruRegs - If MI implicitly def/uses a register, then
167 /// return that register and all subregisters.
168 void GetPassthruRegs(MachineInstr *MI, std::set<unsigned>& PassthruRegs);
169
David Goodwin3e72d302009-11-19 23:12:37 +0000170 void HandleLastUse(unsigned Reg, unsigned KillIdx, const char *tag,
171 const char *header =NULL, const char *footer =NULL);
172
David Goodwin34877712009-10-26 19:32:42 +0000173 void PrescanInstruction(MachineInstr *MI, unsigned Count,
174 std::set<unsigned>& PassthruRegs);
175 void ScanInstruction(MachineInstr *MI, unsigned Count);
176 BitVector GetRenameRegisters(unsigned Reg);
177 bool FindSuitableFreeRegisters(unsigned AntiDepGroupIndex,
David Goodwin54097832009-11-05 01:19:35 +0000178 RenameOrderType& RenameOrder,
David Goodwin34877712009-10-26 19:32:42 +0000179 std::map<unsigned, unsigned> &RenameMap);
180 };
181}
182
183#endif