HomeSort by: relevance | last modified time | path
    Searched refs:PBQP (Results 1 - 11 of 11) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
PBQPRAConstraint.h 9 // This file defines the PBQPBuilder interface, for classes which build PBQP
24 namespace PBQP {
27 // Forward declare PBQP graph class.
31 } // end namespace PBQP
33 using PBQPRAGraph = PBQP::RegAlloc::PBQPRAGraph;
35 /// Abstract base for classes implementing PBQP register allocation
46 /// PBQP register allocation constraint composer.
49 /// added, to the PBQP graph.
RegAllocPBQP.h 9 // This file defines the PBQPBuilder interface, for classes which build PBQP
20 #include "llvm/CodeGen/PBQP/CostAllocator.h"
21 #include "llvm/CodeGen/PBQP/Graph.h"
22 #include "llvm/CodeGen/PBQP/Math.h"
23 #include "llvm/CodeGen/PBQP/ReductionRules.h"
24 #include "llvm/CodeGen/PBQP/Solution.h"
44 namespace PBQP {
131 /// Holds graph-level metadata relevant to PBQP RA problems.
168 /// Holds solver state and other metadata relevant to each PBQP RA node.
274 using RawVector = PBQP::Vector
    [all...]
CodeGenPassBuilder.h 1021 else if (Opt.RegAlloc == RegAllocType::PBQP)
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/
Solution.h 1 //===- Solution.h - PBQP Solution -------------------------------*- C++ -*-===//
9 // PBQP Solution class.
16 #include "llvm/CodeGen/PBQP/Graph.h"
21 namespace PBQP {
23 /// Represents a solution to a PBQP problem.
52 } // end namespace PBQP
ReductionRules.h 23 namespace PBQP {
161 if (V[i] != std::numeric_limits<PBQP::PBQPNum>::infinity())
219 } // end namespace PBQP
CostAllocator.h 1 //===- CostAllocator.h - PBQP Cost Allocator --------------------*- C++ -*-===//
9 // Defines classes conforming to the PBQP cost value manager concept.
11 // Cost value managers are memory managers for PBQP cost values (vectors and
12 // matrices). Since PBQP graphs can grow very large (E.g. hundreds of thousands
26 namespace PBQP {
131 } // end namespace PBQP
Math.h 1 //===- Math.h - PBQP Vector and Matrix classes ------------------*- C++ -*-===//
20 namespace PBQP {
24 /// PBQP Vector class.
29 /// Construct a PBQP vector of the given size.
33 /// Construct a PBQP vector with initializer.
39 /// Copy construct a PBQP vector.
45 /// Move construct a PBQP vector.
120 /// PBQP Matrix class
126 /// Construct a PBQP Matrix with the given dimensions.
131 /// Construct a PBQP Matrix with the given dimensions and initia
    [all...]
Graph.h 1 //===- Graph.h - PBQP Graph -------------------------------------*- C++ -*-===//
9 // PBQP Graph class.
24 namespace PBQP {
42 /// PBQP Graph class.
43 /// Instances of this class describe PBQP problems.
340 /// Construct an empty PBQP graph.
343 /// Construct an empty PBQP graph with the given graph metadata.
608 /// support efficient PBQP graph-reduction based solvers. It is used to
671 } // end namespace PBQP
  /src/external/apache2/llvm/dist/llvm/include/llvm/Target/
CGPassBuilderOption.h 25 enum class RegAllocType { Default, Basic, Fast, Greedy, PBQP };
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RegAllocPBQP.cpp 1 //===- RegAllocPBQP.cpp ---- PBQP Register Allocator ----------------------===//
9 // This file contains a Partitioned Boolean Quadratic Programming (PBQP) based
10 // register allocator for LLVM. This allocator works by constructing a PBQP
12 // solving this using a PBQP solver, and mapping the solution back to a
16 // The PBQP solver (pbqp.c) provided for this allocator uses a heuristic tuned
17 // for register allocation. For more information on PBQP for register
21 // PBQP. In Proceedings of the 7th Joint Modular Languages Conference
54 #include "llvm/CodeGen/PBQP/Graph.h"
55 #include "llvm/CodeGen/PBQP/Math.h
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64PBQPRegAlloc.cpp 1 //===-- AArch64PBQPRegAlloc.cpp - AArch64 specific PBQP constraints -------===//
9 // constraints for use by the PBQP register allocator.
17 #define DEBUG_TYPE "aarch64-pbqp"
197 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity();
218 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min();
223 std::numeric_limits<PBQP::PBQPNum>::infinity() &&
279 "PBQP error ! The edge should exist !");
289 PBQP::Matrix costs(G.getEdgeCosts(edge));
295 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min()
    [all...]

Completed in 26 milliseconds