Searched refs:PBQP (Results 1 - 8 of 8) sorted by relevance

/freebsd-10.2-release/contrib/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h10 // This file defines the PBQPBuilder interface, for classes which build PBQP
21 #include "llvm/CodeGen/PBQP/Graph.h"
22 #include "llvm/CodeGen/PBQP/Solution.h"
34 /// This class wraps up a PBQP instance representing a register allocation
35 /// problem, plus the structures necessary to map back from the PBQP solution
36 /// to a register allocation solution. (i.e. The PBQP-node <--> vreg map,
37 /// and the PBQP option <--> storage location map).
44 PBQP::Graph& getGraph() { return graph; }
46 const PBQP::Graph& getGraph() const { return graph; }
48 /// Record the mapping between the given virtual register and PBQP nod
[all...]
/freebsd-10.2-release/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp1 //===------ RegAllocPBQP.cpp ---- PBQP Register Allocator -------*- C++ -*-===//
10 // This file contains a Partitioned Boolean Quadratic Programming (PBQP) based
11 // register allocator for LLVM. This allocator works by constructing a PBQP
13 // solving this using a PBQP solver, and mapping the solution back to a
17 // The PBQP solver (pbqp.c) provided for this allocator uses a heuristic tuned
18 // for register allocation. For more information on PBQP for register
22 // PBQP. In Proceedings of the 7th Joint Modular Languages Conference
48 #include "llvm/CodeGen/PBQP/Graph.h"
49 #include "llvm/CodeGen/PBQP/HeuristicSolver.h"
50 #include "llvm/CodeGen/PBQP/Heuristic
[all...]
/freebsd-10.2-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DSolution.h1 //===-- Solution.h ------- PBQP Solution ------------------------*- C++ -*-===//
10 // PBQP Solution class.
21 namespace PBQP { namespace
23 /// \brief Represents a solution to a PBQP problem.
H A DHeuristicBase.h1 //===-- HeuristcBase.h --- Heuristic base class for PBQP --------*- C++ -*-===//
15 namespace PBQP { namespace
33 /// edge into the PBQP graph (by R2).
49 /// node/edge in the PBQP graph.
167 /// \brief Perform the PBQP reduction process.
213 /// \brief Handle the addition of a new edge into the PBQP graph.
H A DMath.h1 //===------ Math.h - PBQP Vector and Matrix classes -------------*- C++ -*-===//
17 namespace PBQP { namespace
21 /// \brief PBQP Vector class.
25 /// \brief Construct a PBQP vector of the given size.
30 /// \brief Construct a PBQP vector with initializer.
36 /// \brief Copy construct a PBQP vector.
111 /// \brief PBQP Matrix class
115 /// \brief Construct a PBQP Matrix with the given dimensions.
120 /// \brief Construct a PBQP Matrix with the given dimensions and initial
127 /// \brief Copy construct a PBQP matri
[all...]
H A DGraph.h1 //===-------------------- Graph.h - PBQP Graph ------------------*- C++ -*-===//
10 // PBQP Graph class.
25 namespace PBQP { namespace
27 /// PBQP Graph class.
28 /// Instances of this class describe PBQP problems.
207 /// \brief Construct an empty PBQP graph.
252 /// Typically used by a PBQP solver to attach data to aid in solution.
276 /// Typically used by a PBQP solver to attach data to aid in solution.
414 assert(n1 != n2 && "PBQP graphs shound not have self-edges.");
H A DHeuristicSolver.h1 //===-- HeuristicSolver.h - Heuristic PBQP Solver --------------*- C++ -*-===//
10 // Heuristic PBQP solver. This solver is able to perform optimal reductions for
24 namespace PBQP { namespace
26 /// \brief Heuristic PBQP solver implementation.
173 /// \brief Compute a solution to the PBQP problem instance with which this
175 /// @return A solution to the PBQP problem.
177 /// Performs the full PBQP heuristic solver algorithm, including setup,
596 /// \brief PBQP heuristic solver class.
598 /// Given a PBQP Graph g representing a PBQP proble
[all...]
/freebsd-10.2-release/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h1 //===-- Briggs.h --- Briggs Heuristic for PBQP ------------------*- C++ -*-===//
11 // PBQP graph representing a register allocation problem. Nodes which can be
13 // the PBQP graph first. If no provably allocable node is present in the graph
25 namespace PBQP { namespace
28 /// \brief PBQP Heuristic which applies an allocability test based on
31 /// This heuristic assumes that the elements of cost vectors in the PBQP
64 const PBQP::Vector &cv1 = g->getNodeCosts(n1Id);
65 const PBQP::Vector &cv2 = g->getNodeCosts(n2Id);
207 /// \brief Handle the addition of a new edge into the PBQP graph.

Completed in 102 milliseconds