in the future to attach useful information about the PBQP graph (e.g. the
associated MachineFunction, pointers to regalloc passes) to the graph itself,
making that information accessible to the solver. This should also allow the
PBQPBuilder interface to be simplified.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@218848
91177308-0d34-0410-b5e6-
96231b3b80d8
typedef typename CostAllocator::MatrixPtr MatrixPtr;
typedef typename SolverT::NodeMetadata NodeMetadata;
typedef typename SolverT::EdgeMetadata EdgeMetadata;
typedef typename CostAllocator::MatrixPtr MatrixPtr;
typedef typename SolverT::NodeMetadata NodeMetadata;
typedef typename SolverT::EdgeMetadata EdgeMetadata;
+ typedef typename SolverT::GraphMetadata GraphMetadata;
+ GraphMetadata Metadata;
CostAllocator CostAlloc;
SolverT *Solver;
CostAllocator CostAlloc;
SolverT *Solver;
/// \brief Construct an empty PBQP graph.
Graph() : Solver(nullptr) { }
/// \brief Construct an empty PBQP graph.
Graph() : Solver(nullptr) { }
+ /// \brief Get a reference to the graph metadata.
+ GraphMetadata& getMetadata() { return Metadata; }
+
+ /// \brief Get a const-reference to the graph metadata.
+ const GraphMetadata& getMetadata() const { return Metadata; }
+
/// \brief Lock this graph to the given solver instance in preparation
/// for running the solver. This method will call solver.handleAddNode for
/// each node in the graph, and handleAddEdge for each edge, to give the
/// \brief Lock this graph to the given solver instance in preparation
/// for running the solver. This method will call solver.handleAddNode for
/// each node in the graph, and handleAddEdge for each edge, to give the
typedef RegAlloc::NodeMetadata NodeMetadata;
struct EdgeMetadata { };
typedef RegAlloc::NodeMetadata NodeMetadata;
struct EdgeMetadata { };
+ struct GraphMetadata { };
typedef PBQP::Graph<RegAllocSolverImpl> Graph;
typedef PBQP::Graph<RegAllocSolverImpl> Graph;