diff options
author | Lang Hames <lhames@gmail.com> | 2010-09-02 05:37:52 +0000 |
---|---|---|
committer | Lang Hames <lhames@gmail.com> | 2010-09-02 05:37:52 +0000 |
commit | 7642572e6d5e3ca0c5d18e2591989bd5c4f4b31c (patch) | |
tree | f07f2a02c965ab67e66f7783d5a293b385b0597d /lib/CodeGen/PBQP/Solution.h | |
parent | 3722f007b6f60f7556c721d6ca3e10bfd171141d (diff) | |
download | llvm-7642572e6d5e3ca0c5d18e2591989bd5c4f4b31c.tar.gz llvm-7642572e6d5e3ca0c5d18e2591989bd5c4f4b31c.tar.bz2 llvm-7642572e6d5e3ca0c5d18e2591989bd5c4f4b31c.tar.xz |
Added counters for PBQP reduction rules.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@112807 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/CodeGen/PBQP/Solution.h')
-rw-r--r-- | lib/CodeGen/PBQP/Solution.h | 31 |
1 files changed, 31 insertions, 0 deletions
diff --git a/lib/CodeGen/PBQP/Solution.h b/lib/CodeGen/PBQP/Solution.h index 294b5370af..047fd04c7c 100644 --- a/lib/CodeGen/PBQP/Solution.h +++ b/lib/CodeGen/PBQP/Solution.h @@ -26,15 +26,46 @@ namespace PBQP { /// To get the selection for each node in the problem use the getSelection method. class Solution { private: + typedef std::map<Graph::NodeItr, unsigned, NodeItrComparator> SelectionsMap; SelectionsMap selections; + unsigned r0Reductions, r1Reductions, r2Reductions, rNReductions; + public: /// \brief Number of nodes for which selections have been made. /// @return Number of nodes for which selections have been made. unsigned numNodes() const { return selections.size(); } + /// \brief Records a reduction via the R0 rule. Should be called from the + /// solver only. + void recordR0() { ++r0Reductions; } + + /// \brief Returns the number of R0 reductions applied to solve the problem. + unsigned numR0Reductions() const { return r0Reductions; } + + /// \brief Records a reduction via the R1 rule. Should be called from the + /// solver only. + void recordR1() { ++r1Reductions; } + + /// \brief Returns the number of R1 reductions applied to solve the problem. + unsigned numR1Reductions() const { return r1Reductions; } + + /// \brief Records a reduction via the R2 rule. Should be called from the + /// solver only. + void recordR2() { ++r2Reductions; } + + /// \brief Returns the number of R2 reductions applied to solve the problem. + unsigned numR2Reductions() const { return r2Reductions; } + + /// \brief Records a reduction via the RN rule. Should be called from the + /// solver only. + void recordRN() { ++ rNReductions; } + + /// \brief Returns the number of RN reductions applied to solve the problem. + unsigned numRNReductions() const { return rNReductions; } + /// \brief Set the selection for a given node. /// @param nItr Node iterator. /// @param selection Selection for nItr. |