Home
last modified time | relevance | path

Searched refs:PBQPNum (Results 1 – 5 of 5) sorted by relevance

/openbsd/src/gnu/llvm/llvm/include/llvm/CodeGen/PBQP/
DMath.h22 using PBQPNum = float; variable
31 : Length(Length), Data(std::make_unique<PBQPNum []>(Length)) {} in Vector()
34 Vector(unsigned Length, PBQPNum InitVal) in Vector()
35 : Length(Length), Data(std::make_unique<PBQPNum []>(Length)) { in Vector()
41 : Length(V.Length), Data(std::make_unique<PBQPNum []>(Length)) { in Vector()
66 PBQPNum& operator[](unsigned Index) {
73 const PBQPNum& operator[](unsigned Index) const {
84 std::plus<PBQPNum>());
96 std::unique_ptr<PBQPNum []> Data;
128 Rows(Rows), Cols(Cols), Data(std::make_unique<PBQPNum []>(Rows * Cols)) { in Matrix()
[all …]
DReductionRules.h50 PBQPNum Min = ECosts[0][j] + XCosts[0]; in applyR1()
52 PBQPNum C = ECosts[i][j] + XCosts[i]; in applyR1()
60 PBQPNum Min = ECosts[i][0] + XCosts[0]; in applyR1()
62 PBQPNum C = ECosts[i][j] + XCosts[j]; in applyR1()
112 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0]; in applyR2()
114 PBQPNum C = (*YXECosts)[i][k] + (*ZXECosts)[j][k] + XCosts[k]; in applyR2()
161 if (V[i] != std::numeric_limits<PBQP::PBQPNum>::infinity()) in hasRegisterOptions()
/openbsd/src/gnu/llvm/llvm/lib/Target/AArch64/
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()
295 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); in addInterChainConstraint()
300 std::numeric_limits<PBQP::PBQPNum>::infinity() && in addInterChainConstraint()
/openbsd/src/gnu/llvm/llvm/lib/CodeGen/
DRegAllocPBQP.cpp197 const PBQP::PBQPNum MinSpillCost = 10.0; in apply()
200 PBQP::PBQPNum SpillCost = in apply()
203 SpillCost = std::numeric_limits<PBQP::PBQPNum>::min(); in apply()
419 M[I + 1][J + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in createInterferenceEdge()
453 PBQP::PBQPNum CBenefit = MBFI.getBlockFreqRelativeToEntryBlock(&MBB); in apply()
506 PBQP::PBQPNum Benefit) { in addVirtRegCoalesce()
/openbsd/src/gnu/llvm/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h63 if (M[i][j] == std::numeric_limits<PBQPNum>::infinity()) { in MatrixMetadata()
485 PBQPNum N1SC = G.getNodeCosts(N1Id)[0]; in operator()
486 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; in operator()