Home
last modified time | relevance | path

Searched refs:PBQP (Results 1 – 17 of 17) sorted by relevance

/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp175 const PBQP::Solution &Solution,
197 const PBQP::PBQPNum MinSpillCost = 10.0; in apply()
200 PBQP::PBQPNum SpillCost = in apply()
203 SpillCost = std::numeric_limits<PBQP::PBQPNum>::min(); in apply()
207 NodeCosts[PBQP::RegAlloc::getSpillOptionIdx()] = SpillCost; in apply()
220 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>;
364 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
366 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply()
506 PBQP::PBQPNum Benefit) { in addVirtRegCoalesce()
737 if (AllocOpt != PBQP::RegAlloc::getSpillOptionIdx()) { in mapPBQPToRegAlloc()
[all …]
H A DCMakeLists.txt240 ${LLVM_MAIN_INCLUDE_DIR}/llvm/CodeGen/PBQP
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp197 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
218 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); in addIntraChainConstraint()
223 std::numeric_limits<PBQP::PBQPNum>::infinity() && in addIntraChainConstraint()
289 PBQP::Matrix costs(G.getEdgeCosts(edge)); in addInterChainConstraint()
295 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); in addInterChainConstraint()
300 std::numeric_limits<PBQP::PBQPNum>::infinity() && in addInterChainConstraint()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h44 namespace PBQP {
275 using RawVector = PBQP::Vector;
276 using RawMatrix = PBQP::Matrix;
277 using Vector = PBQP::Vector;
279 using CostAllocator = PBQP::PoolCostAllocator<Vector, Matrix>;
288 using Graph = PBQP::Graph<RegAllocSolverImpl>;
503 class PBQPRAGraph : public PBQP::Graph<RegAllocSolverImpl> {
505 using BaseT = PBQP::Graph<RegAllocSolverImpl>;
H A DPBQPRAConstraint.h24 namespace PBQP {
33 using PBQPRAGraph = PBQP::RegAlloc::PBQPRAGraph;
H A DCodeGenPassBuilder.h1022 else if (Opt.RegAlloc == RegAllocType::PBQP) in addRegAllocPass()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/
H A DSolution.h21 namespace PBQP {
H A DReductionRules.h23 namespace PBQP {
161 if (V[i] != std::numeric_limits<PBQP::PBQPNum>::infinity()) in hasRegisterOptions()
H A DCostAllocator.h26 namespace PBQP {
H A DMath.h20 namespace PBQP {
H A DGraph.h24 namespace PBQP {
/llvm-project-15.0.7/llvm/include/llvm/Target/
H A DCGPassBuilderOption.h24 enum class RegAllocType { Default, Basic, Fast, Greedy, PBQP }; enumerator
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A DPBQP-chain.ll4 ; Test PBQP is able to fulfill the accumulator chaining constraint.
/llvm-project-15.0.7/llvm/
H A DCREDITS.TXT205 D: PBQP-based register allocator
/llvm-project-15.0.7/llvm/docs/
H A DCodeGenerator.rst1497 * *PBQP* --- A Partitioned Boolean Quadratic Programming (PBQP) based register
1498 allocator. This allocator works by constructing a PBQP problem representing
1499 the register allocation problem under consideration, solving this using a PBQP
/llvm-project-15.0.7/clang/docs/
H A DClangFormattedStatus.rst4152 * - llvm/include/llvm/CodeGen/PBQP
/llvm-project-15.0.7/clang/docs/tools/
H A Dclang-formatted-files.txt5116 llvm/include/llvm/CodeGen/PBQP/CostAllocator.h