Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp172 const PBQP::Solution &Solution,
194 const PBQP::PBQPNum MinSpillCost = 10.0; in apply()
197 PBQP::PBQPNum SpillCost = in apply()
200 SpillCost = std::numeric_limits<PBQP::PBQPNum>::min(); in apply()
204 NodeCosts[PBQP::RegAlloc::getSpillOptionIdx()] = SpillCost; in apply()
213 using AllowedRegVecPtr = const PBQP::RegAlloc::AllowedRegVector *;
217 using IEdgeKey = std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId>;
254 std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>;
264 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { in getNodeId()
361 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp190 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
211 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); in addIntraChainConstraint()
216 std::numeric_limits<PBQP::PBQPNum>::infinity() && in addIntraChainConstraint()
282 PBQP::Matrix costs(G.getEdgeCosts(edge)); in addInterChainConstraint()
288 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); in addInterChainConstraint()
293 std::numeric_limits<PBQP::PBQPNum>::infinity() && in addInterChainConstraint()
/freebsd/contrib/llvm-project/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>;
501 class PBQPRAGraph : public PBQP::Graph<RegAllocSolverImpl> {
503 using BaseT = PBQP::Graph<RegAllocSolverImpl>;
H A DPBQPRAConstraint.h25 namespace PBQP {
34 using PBQPRAGraph = PBQP::RegAlloc::PBQPRAGraph;
/freebsd/contrib/llvm-project/llvm/include/llvm/Target/
H A DCGPassBuilderOption.h25 enum class RegAllocType { Unset, Default, Basic, Fast, Greedy, PBQP }; enumerator
34 addLiteralOption("pbqp", RegAllocType::PBQP, "PBQP register allocator"); in initialize()
/freebsd/contrib/llvm-project/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.h22 namespace PBQP {
H A DGraph.h24 namespace PBQP {