mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-24 04:56:51 +00:00
030c4bfbc9
* Fixed a reduction bug which occasionally led to infinite-cost (invalid) register allocation solutions despite the existence finite-cost solutions. * Significantly reduced memory usage (>50% reduction). * Simplified a lot of the solver code. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@94514 91177308-0d34-0410-b5e6-96231b3b80d8
59 lines
1.7 KiB
C++
59 lines
1.7 KiB
C++
//===-- Solution.h ------- PBQP Solution ------------------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// PBQP Solution class.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_CODEGEN_PBQP_SOLUTION_H
|
|
#define LLVM_CODEGEN_PBQP_SOLUTION_H
|
|
|
|
#include "Math.h"
|
|
#include "Graph.h"
|
|
|
|
#include <map>
|
|
|
|
namespace PBQP {
|
|
|
|
/// \brief Represents a solution to a PBQP problem.
|
|
///
|
|
/// 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;
|
|
|
|
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 Set the selection for a given node.
|
|
/// @param nItr Node iterator.
|
|
/// @param selection Selection for nItr.
|
|
void setSelection(Graph::NodeItr nItr, unsigned selection) {
|
|
selections[nItr] = selection;
|
|
}
|
|
|
|
/// \brief Get a node's selection.
|
|
/// @param nItr Node iterator.
|
|
/// @return The selection for nItr;
|
|
unsigned getSelection(Graph::NodeItr nItr) const {
|
|
SelectionsMap::const_iterator sItr = selections.find(nItr);
|
|
assert(sItr != selections.end() && "No selection for node.");
|
|
return sItr->second;
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
#endif // LLVM_CODEGEN_PBQP_SOLUTION_H
|