1 //===-- RegAllocPBQP.h ------------------------------------------*- C++ -*-===//
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 defines the PBQPBuilder interface, for classes which build PBQP
11 // instances to represent register allocation problems, and the RegAllocPBQP
14 //===----------------------------------------------------------------------===//
16 #ifndef LLVM_CODEGEN_REGALLOCPBQP_H
17 #define LLVM_CODEGEN_REGALLOCPBQP_H
19 #include "llvm/CodeGen/MachineFunctionPass.h"
20 #include "llvm/CodeGen/PBQPRAConstraint.h"
21 #include "llvm/CodeGen/PBQP/CostAllocator.h"
22 #include "llvm/CodeGen/PBQP/ReductionRules.h"
23 #include "llvm/Support/ErrorHandling.h"
29 /// @brief Spill option index.
30 inline unsigned getSpillOptionIdx() { return 0; }
32 /// \brief Metadata to speed allocatability test.
34 /// Keeps track of the number of infinities in each row and column.
35 class MatrixMetadata {
37 MatrixMetadata(const MatrixMetadata&);
38 void operator=(const MatrixMetadata&);
40 MatrixMetadata(const Matrix& M)
41 : WorstRow(0), WorstCol(0),
42 UnsafeRows(new bool[M.getRows() - 1]()),
43 UnsafeCols(new bool[M.getCols() - 1]()) {
45 unsigned* ColCounts = new unsigned[M.getCols() - 1]();
47 for (unsigned i = 1; i < M.getRows(); ++i) {
48 unsigned RowCount = 0;
49 for (unsigned j = 1; j < M.getCols(); ++j) {
50 if (M[i][j] == std::numeric_limits<PBQPNum>::infinity()) {
53 UnsafeRows[i - 1] = true;
54 UnsafeCols[j - 1] = true;
57 WorstRow = std::max(WorstRow, RowCount);
59 unsigned WorstColCountForCurRow =
60 *std::max_element(ColCounts, ColCounts + M.getCols() - 1);
61 WorstCol = std::max(WorstCol, WorstColCountForCurRow);
70 unsigned getWorstRow() const { return WorstRow; }
71 unsigned getWorstCol() const { return WorstCol; }
72 const bool* getUnsafeRows() const { return UnsafeRows; }
73 const bool* getUnsafeCols() const { return UnsafeCols; }
76 unsigned WorstRow, WorstCol;
83 typedef std::vector<unsigned> OptionToRegMap;
85 typedef enum { Unprocessed,
87 ConservativelyAllocatable,
88 NotProvablyAllocatable } ReductionState;
90 NodeMetadata() : RS(Unprocessed), DeniedOpts(0), OptUnsafeEdges(nullptr){}
91 ~NodeMetadata() { delete[] OptUnsafeEdges; }
93 void setVReg(unsigned VReg) { this->VReg = VReg; }
94 unsigned getVReg() const { return VReg; }
96 void setOptionRegs(OptionToRegMap OptionRegs) {
97 this->OptionRegs = std::move(OptionRegs);
99 const OptionToRegMap& getOptionRegs() const { return OptionRegs; }
101 void setup(const Vector& Costs) {
102 NumOpts = Costs.getLength() - 1;
103 OptUnsafeEdges = new unsigned[NumOpts]();
106 ReductionState getReductionState() const { return RS; }
107 void setReductionState(ReductionState RS) { this->RS = RS; }
109 void handleAddEdge(const MatrixMetadata& MD, bool Transpose) {
110 DeniedOpts += Transpose ? MD.getWorstCol() : MD.getWorstRow();
111 const bool* UnsafeOpts =
112 Transpose ? MD.getUnsafeCols() : MD.getUnsafeRows();
113 for (unsigned i = 0; i < NumOpts; ++i)
114 OptUnsafeEdges[i] += UnsafeOpts[i];
117 void handleRemoveEdge(const MatrixMetadata& MD, bool Transpose) {
118 DeniedOpts -= Transpose ? MD.getWorstCol() : MD.getWorstRow();
119 const bool* UnsafeOpts =
120 Transpose ? MD.getUnsafeCols() : MD.getUnsafeRows();
121 for (unsigned i = 0; i < NumOpts; ++i)
122 OptUnsafeEdges[i] -= UnsafeOpts[i];
125 bool isConservativelyAllocatable() const {
126 return (DeniedOpts < NumOpts) ||
127 (std::find(OptUnsafeEdges, OptUnsafeEdges + NumOpts, 0) !=
128 OptUnsafeEdges + NumOpts);
135 unsigned* OptUnsafeEdges;
137 OptionToRegMap OptionRegs;
140 class RegAllocSolverImpl {
142 typedef MDMatrix<MatrixMetadata> RAMatrix;
144 typedef PBQP::Vector RawVector;
145 typedef PBQP::Matrix RawMatrix;
146 typedef PBQP::Vector Vector;
147 typedef RAMatrix Matrix;
148 typedef PBQP::PoolCostAllocator<Vector, Matrix> CostAllocator;
150 typedef GraphBase::NodeId NodeId;
151 typedef GraphBase::EdgeId EdgeId;
153 typedef RegAlloc::NodeMetadata NodeMetadata;
155 struct EdgeMetadata { };
157 class GraphMetadata {
159 GraphMetadata(MachineFunction &MF,
161 MachineBlockFrequencyInfo &MBFI)
162 : MF(MF), LIS(LIS), MBFI(MBFI) {}
166 MachineBlockFrequencyInfo &MBFI;
168 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
169 VRegToNodeId[VReg] = NId;
172 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const {
173 auto VRegItr = VRegToNodeId.find(VReg);
174 if (VRegItr == VRegToNodeId.end())
175 return GraphBase::invalidNodeId();
176 return VRegItr->second;
179 void eraseNodeIdForVReg(unsigned VReg) {
180 VRegToNodeId.erase(VReg);
184 DenseMap<unsigned, NodeId> VRegToNodeId;
187 typedef PBQP::Graph<RegAllocSolverImpl> Graph;
189 RegAllocSolverImpl(Graph &G) : G(G) {}
195 S = backpropagate(G, reduce());
200 void handleAddNode(NodeId NId) {
201 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
203 void handleRemoveNode(NodeId NId) {}
204 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
206 void handleAddEdge(EdgeId EId) {
207 handleReconnectEdge(EId, G.getEdgeNode1Id(EId));
208 handleReconnectEdge(EId, G.getEdgeNode2Id(EId));
211 void handleRemoveEdge(EdgeId EId) {
212 handleDisconnectEdge(EId, G.getEdgeNode1Id(EId));
213 handleDisconnectEdge(EId, G.getEdgeNode2Id(EId));
216 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
217 NodeMetadata& NMd = G.getNodeMetadata(NId);
218 const MatrixMetadata& MMd = G.getEdgeCosts(EId).getMetadata();
219 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId));
220 if (G.getNodeDegree(NId) == 3) {
221 // This node is becoming optimally reducible.
222 moveToOptimallyReducibleNodes(NId);
223 } else if (NMd.getReductionState() ==
224 NodeMetadata::NotProvablyAllocatable &&
225 NMd.isConservativelyAllocatable()) {
226 // This node just became conservatively allocatable.
227 moveToConservativelyAllocatableNodes(NId);
231 void handleReconnectEdge(EdgeId EId, NodeId NId) {
232 NodeMetadata& NMd = G.getNodeMetadata(NId);
233 const MatrixMetadata& MMd = G.getEdgeCosts(EId).getMetadata();
234 NMd.handleAddEdge(MMd, NId == G.getEdgeNode2Id(EId));
237 void handleSetEdgeCosts(EdgeId EId, const Matrix& NewCosts) {
238 handleRemoveEdge(EId);
240 NodeId N1Id = G.getEdgeNode1Id(EId);
241 NodeId N2Id = G.getEdgeNode2Id(EId);
242 NodeMetadata& N1Md = G.getNodeMetadata(N1Id);
243 NodeMetadata& N2Md = G.getNodeMetadata(N2Id);
244 const MatrixMetadata& MMd = NewCosts.getMetadata();
245 N1Md.handleAddEdge(MMd, N1Id != G.getEdgeNode1Id(EId));
246 N2Md.handleAddEdge(MMd, N2Id != G.getEdgeNode1Id(EId));
251 void removeFromCurrentSet(NodeId NId) {
252 switch (G.getNodeMetadata(NId).getReductionState()) {
253 case NodeMetadata::Unprocessed: break;
254 case NodeMetadata::OptimallyReducible:
255 assert(OptimallyReducibleNodes.find(NId) !=
256 OptimallyReducibleNodes.end() &&
257 "Node not in optimally reducible set.");
258 OptimallyReducibleNodes.erase(NId);
260 case NodeMetadata::ConservativelyAllocatable:
261 assert(ConservativelyAllocatableNodes.find(NId) !=
262 ConservativelyAllocatableNodes.end() &&
263 "Node not in conservatively allocatable set.");
264 ConservativelyAllocatableNodes.erase(NId);
266 case NodeMetadata::NotProvablyAllocatable:
267 assert(NotProvablyAllocatableNodes.find(NId) !=
268 NotProvablyAllocatableNodes.end() &&
269 "Node not in not-provably-allocatable set.");
270 NotProvablyAllocatableNodes.erase(NId);
275 void moveToOptimallyReducibleNodes(NodeId NId) {
276 removeFromCurrentSet(NId);
277 OptimallyReducibleNodes.insert(NId);
278 G.getNodeMetadata(NId).setReductionState(
279 NodeMetadata::OptimallyReducible);
282 void moveToConservativelyAllocatableNodes(NodeId NId) {
283 removeFromCurrentSet(NId);
284 ConservativelyAllocatableNodes.insert(NId);
285 G.getNodeMetadata(NId).setReductionState(
286 NodeMetadata::ConservativelyAllocatable);
289 void moveToNotProvablyAllocatableNodes(NodeId NId) {
290 removeFromCurrentSet(NId);
291 NotProvablyAllocatableNodes.insert(NId);
292 G.getNodeMetadata(NId).setReductionState(
293 NodeMetadata::NotProvablyAllocatable);
298 for (auto NId : G.nodeIds()) {
299 if (G.getNodeDegree(NId) < 3)
300 moveToOptimallyReducibleNodes(NId);
301 else if (G.getNodeMetadata(NId).isConservativelyAllocatable())
302 moveToConservativelyAllocatableNodes(NId);
304 moveToNotProvablyAllocatableNodes(NId);
308 // Compute a reduction order for the graph by iteratively applying PBQP
309 // reduction rules. Locally optimal rules are applied whenever possible (R0,
310 // R1, R2). If no locally-optimal rules apply then any conservatively
311 // allocatable node is reduced. Finally, if no conservatively allocatable
312 // node exists then the node with the lowest spill-cost:degree ratio is
314 std::vector<GraphBase::NodeId> reduce() {
315 assert(!G.empty() && "Cannot reduce empty graph.");
317 typedef GraphBase::NodeId NodeId;
318 std::vector<NodeId> NodeStack;
320 // Consume worklists.
322 if (!OptimallyReducibleNodes.empty()) {
323 NodeSet::iterator NItr = OptimallyReducibleNodes.begin();
325 OptimallyReducibleNodes.erase(NItr);
326 NodeStack.push_back(NId);
327 switch (G.getNodeDegree(NId)) {
336 default: llvm_unreachable("Not an optimally reducible node.");
338 } else if (!ConservativelyAllocatableNodes.empty()) {
339 // Conservatively allocatable nodes will never spill. For now just
340 // take the first node in the set and push it on the stack. When we
341 // start optimizing more heavily for register preferencing, it may
342 // would be better to push nodes with lower 'expected' or worst-case
343 // register costs first (since early nodes are the most
345 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin();
347 ConservativelyAllocatableNodes.erase(NItr);
348 NodeStack.push_back(NId);
349 G.disconnectAllNeighborsFromNode(NId);
351 } else if (!NotProvablyAllocatableNodes.empty()) {
352 NodeSet::iterator NItr =
353 std::min_element(NotProvablyAllocatableNodes.begin(),
354 NotProvablyAllocatableNodes.end(),
355 SpillCostComparator(G));
357 NotProvablyAllocatableNodes.erase(NItr);
358 NodeStack.push_back(NId);
359 G.disconnectAllNeighborsFromNode(NId);
367 class SpillCostComparator {
369 SpillCostComparator(const Graph& G) : G(G) {}
370 bool operator()(NodeId N1Id, NodeId N2Id) {
371 PBQPNum N1SC = G.getNodeCosts(N1Id)[0] / G.getNodeDegree(N1Id);
372 PBQPNum N2SC = G.getNodeCosts(N2Id)[0] / G.getNodeDegree(N2Id);
380 typedef std::set<NodeId> NodeSet;
381 NodeSet OptimallyReducibleNodes;
382 NodeSet ConservativelyAllocatableNodes;
383 NodeSet NotProvablyAllocatableNodes;
386 class PBQPRAGraph : public PBQP::Graph<RegAllocSolverImpl> {
388 typedef PBQP::Graph<RegAllocSolverImpl> BaseT;
390 PBQPRAGraph(GraphMetadata Metadata) : BaseT(Metadata) {}
393 inline Solution solve(PBQPRAGraph& G) {
396 RegAllocSolverImpl RegAllocSolver(G);
397 return RegAllocSolver.solve();
400 } // namespace RegAlloc
403 /// @brief Create a PBQP register allocator instance.
405 createPBQPRegisterAllocator(char *customPassID = nullptr);
409 #endif /* LLVM_CODEGEN_REGALLOCPBQP_H */