reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
31 : Length(Length), Data(std::make_unique<PBQPNum []>(Length)) {} 34 Vector(unsigned Length, PBQPNum InitVal) 35 : Length(Length), Data(std::make_unique<PBQPNum []>(Length)) { 41 : Length(V.Length), Data(std::make_unique<PBQPNum []>(Length)) { 66 PBQPNum& operator[](unsigned Index) { 73 const PBQPNum& operator[](unsigned Index) const { 96 std::unique_ptr<PBQPNum []> Data; 128 Rows(Rows), Cols(Cols), Data(std::make_unique<PBQPNum []>(Rows * Cols)) { 133 Matrix(unsigned Rows, unsigned Cols, PBQPNum InitVal) 135 Data(std::make_unique<PBQPNum []>(Rows * Cols)) { 142 Data(std::make_unique<PBQPNum []>(Rows * Cols)) { 173 PBQPNum* operator[](unsigned R) { 180 const PBQPNum* operator[](unsigned R) const { 233 std::unique_ptr<PBQPNum []> Data;include/llvm/CodeGen/PBQP/ReductionRules.h
50 PBQPNum Min = ECosts[0][j] + XCosts[0]; 52 PBQPNum C = ECosts[i][j] + XCosts[i]; 60 PBQPNum Min = ECosts[i][0] + XCosts[0]; 62 PBQPNum C = ECosts[i][j] + XCosts[j]; 112 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0]; 114 PBQPNum C = (*YXECosts)[i][k] + (*ZXECosts)[j][k] + XCosts[k]; 161 if (V[i] != std::numeric_limits<PBQP::PBQPNum>::infinity())include/llvm/CodeGen/RegAllocPBQP.h
61 if (M[i][j] == std::numeric_limits<PBQPNum>::infinity()) { 482 PBQPNum N1SC = G.getNodeCosts(N1Id)[0]; 483 PBQPNum N2SC = G.getNodeCosts(N2Id)[0];lib/CodeGen/RegAllocPBQP.cpp
149 using CoalesceMap = std::map<RegPair, PBQP::PBQPNum>; 198 const PBQP::PBQPNum MinSpillCost = 10.0; 201 PBQP::PBQPNum SpillCost = 204 SpillCost = std::numeric_limits<PBQP::PBQPNum>::min(); 420 M[I + 1][J + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); 455 PBQP::PBQPNum CBenefit = MBFI.getBlockFreq(&MBB).getFrequency() * Scale; 508 PBQP::PBQPNum Benefit) {lib/Target/AArch64/AArch64PBQPRegAlloc.cpp
197 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); 218 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); 218 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); 223 std::numeric_limits<PBQP::PBQPNum>::infinity() && 295 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); 295 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); 300 std::numeric_limits<PBQP::PBQPNum>::infinity() &&