1 //===-- Solution.h ------- PBQP Solution ------------------------*- 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 // PBQP Solution class.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_CODEGEN_PBQP_SOLUTION_H
15 #define LLVM_CODEGEN_PBQP_SOLUTION_H
23 /// \brief Represents a solution to a PBQP problem.
25 /// To get the selection for each node in the problem use the getSelection method.
29 typedef std::map<GraphBase::NodeId, unsigned> SelectionsMap;
30 SelectionsMap selections;
32 unsigned r0Reductions, r1Reductions, r2Reductions, rNReductions;
36 /// \brief Initialise an empty solution.
38 : r0Reductions(0), r1Reductions(0), r2Reductions(0), rNReductions(0) {}
40 /// \brief Number of nodes for which selections have been made.
41 /// @return Number of nodes for which selections have been made.
42 unsigned numNodes() const { return selections.size(); }
44 /// \brief Records a reduction via the R0 rule. Should be called from the
46 void recordR0() { ++r0Reductions; }
48 /// \brief Returns the number of R0 reductions applied to solve the problem.
49 unsigned numR0Reductions() const { return r0Reductions; }
51 /// \brief Records a reduction via the R1 rule. Should be called from the
53 void recordR1() { ++r1Reductions; }
55 /// \brief Returns the number of R1 reductions applied to solve the problem.
56 unsigned numR1Reductions() const { return r1Reductions; }
58 /// \brief Records a reduction via the R2 rule. Should be called from the
60 void recordR2() { ++r2Reductions; }
62 /// \brief Returns the number of R2 reductions applied to solve the problem.
63 unsigned numR2Reductions() const { return r2Reductions; }
65 /// \brief Records a reduction via the RN rule. Should be called from the
67 void recordRN() { ++ rNReductions; }
69 /// \brief Returns the number of RN reductions applied to solve the problem.
70 unsigned numRNReductions() const { return rNReductions; }
72 /// \brief Set the selection for a given node.
73 /// @param nodeId Node id.
74 /// @param selection Selection for nodeId.
75 void setSelection(GraphBase::NodeId nodeId, unsigned selection) {
76 selections[nodeId] = selection;
79 /// \brief Get a node's selection.
80 /// @param nodeId Node id.
81 /// @return The selection for nodeId;
82 unsigned getSelection(GraphBase::NodeId nodeId) const {
83 SelectionsMap::const_iterator sItr = selections.find(nodeId);
84 assert(sItr != selections.end() && "No selection for node.");
92 #endif // LLVM_CODEGEN_PBQP_SOLUTION_H