Search

Home

Sort by

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

/external/llvm/include/llvm/CodeGen/
H A D	RegAllocPBQP.h	10 // 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" 33 /// This class wraps up a PBQP instance representing a register allocation 34 /// problem, plus the structures necessary to map back from the PBQP solution 35 /// to a register allocation solution. (i.e. The PBQP-node <--> vreg map, 36 /// and the PBQP option <--> storage location map). 43 PBQP::Graph& getGraph() { return graph; } 45 const PBQP::Graph& getGraph() const { return graph; } 47 /// Record the mapping between the given virtual register and PBQP nod [all...]
/external/llvm/lib/CodeGen/
H A D	RegAllocPBQP.cpp	1 //===------ 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 46 #include "llvm/CodeGen/PBQP/HeuristicSolver.h" 47 #include "llvm/CodeGen/PBQP/Graph.h" 48 #include "llvm/CodeGen/PBQP/Heuristic [all...]
/external/llvm/include/llvm/CodeGen/PBQP/
H A D	Solution.h	`1 //===-- Solution.h ------- PBQP Solution ------------------------- C++ --===// 10 // PBQP Solution class. 22 namespace PBQP { namespace 24 /// \brief Represents a solution to a PBQP problem.`
H A D	HeuristicBase.h	`1 //===-- 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. 212 /// \brief Handle the addition of a new edge into the PBQP graph.`
H A D	Graph.h	`1 //===-------------------- Graph.h - PBQP Graph ------------------- C++ --===// 10 // PBQP Graph class. 23 namespace PBQP { namespace 25 /// PBQP Graph class. 26 /// Instances of this class describe PBQP problems. 142 /// \brief Construct an empty PBQP graph. 208 /// Typically used by a PBQP solver to attach data to aid in solution. 232 /// Typically used by a PBQP solver to attach data to aid in solution.`
H A D	Math.h	1 //===------ 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 D	HeuristicSolver.h	1 //===-- 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, 594 /// \brief PBQP heuristic solver class. 596 /// Given a PBQP Graph g representing a PBQP proble [all...]
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A D	Briggs.h	1 //===-- 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 26 namespace PBQP { namespace 29 /// \brief PBQP Heuristic which applies an allocability test based on 32 /// This heuristic assumes that the elements of cost vectors in the PBQP 65 const PBQP::Vector &cv1 = g->getNodeCosts(n1Itr); 66 const PBQP::Vector &cv2 = g->getNodeCosts(n2Itr); 208 /// \brief Handle the addition of a new edge into the PBQP graph.

Completed in 83 milliseconds