Home
last modified time | relevance | path

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

/external/llvm/include/llvm/CodeGen/PBQP/
DMath.h21 typedef float PBQPNum; typedef
30 : Length(Length), Data(new PBQPNum[Length]) { in Vector()
36 Vector(unsigned Length, PBQPNum InitVal) in Vector()
37 : Length(Length), Data(new PBQPNum[Length]) { in Vector()
46 : Length(V.Length), Data(new PBQPNum[Length]) { in Vector()
71 Data = new PBQPNum[Length];
101 PBQPNum& operator[](unsigned Index) {
108 const PBQPNum& operator[](unsigned Index) const {
118 std::transform(Data, Data + Length, V.Data, Data, std::plus<PBQPNum>());
126 std::transform(Data, Data + Length, V.Data, Data, std::minus<PBQPNum>());
[all …]
DReductionRules.h49 PBQPNum Min = ECosts[0][j] + XCosts[0]; in applyR1()
51 PBQPNum C = ECosts[i][j] + XCosts[i]; in applyR1()
59 PBQPNum Min = ECosts[i][0] + XCosts[0]; in applyR1()
61 PBQPNum C = ECosts[i][j] + XCosts[j]; in applyR1()
111 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0]; in applyR2()
113 PBQPNum C = (*YXECosts)[i][k] + (*ZXECosts)[j][k] + XCosts[k]; in applyR2()
160 if (V[i] != std::numeric_limits<PBQP::PBQPNum>::infinity()) in hasRegisterOptions()
/external/llvm/lib/Target/AArch64/
DAArch64PBQPRegAlloc.cpp198 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
219 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); in addIntraChainConstraint()
224 std::numeric_limits<PBQP::PBQPNum>::infinity() && in addIntraChainConstraint()
296 PBQP::PBQPNum sameParityMax = std::numeric_limits<PBQP::PBQPNum>::min(); in addInterChainConstraint()
301 std::numeric_limits<PBQP::PBQPNum>::infinity() && in addInterChainConstraint()
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp119 typedef std::map<RegPair, PBQP::PBQPNum> CoalesceMap;
161 const PBQP::PBQPNum MinSpillCost = 10.0; in apply()
164 PBQP::PBQPNum SpillCost = in apply()
167 SpillCost = std::numeric_limits<PBQP::PBQPNum>::min(); in apply()
386 M[I + 1][J + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in createInterferenceEdge()
423 PBQP::PBQPNum CBenefit = MBFI.getBlockFreq(&MBB).getFrequency() * Scale; in apply()
477 PBQP::PBQPNum Benefit) { in addVirtRegCoalesce()
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h53 if (M[i][j] == std::numeric_limits<PBQPNum>::infinity()) { in MatrixMetadata()
547 PBQPNum N1SC = G.getNodeCosts(N1Id)[0]; in operator()
548 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; in operator()