OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:PBQPNum
(Results
1 - 5
of
5
) sorted by null
/external/llvm/include/llvm/CodeGen/PBQP/
Math.h
19
typedef float
PBQPNum
;
27
length(length), data(new
PBQPNum
[length]) {
31
Vector(unsigned length,
PBQPNum
initVal) :
32
length(length), data(new
PBQPNum
[length]) {
38
length(v.length), data(new
PBQPNum
[length]) {
49
data = new
PBQPNum
[length];
60
PBQPNum
& operator[](unsigned index) {
66
const
PBQPNum
& operator[](unsigned index) const {
74
std::transform(data, data + length, v.data, data, std::plus<
PBQPNum
>());
81
std::transform(data, data + length, v.data, data, std::minus<
PBQPNum
>());
[
all
...]
HeuristicSolver.h
252
PBQPNum
min = eCosts[0][j] + xCosts[0];
254
PBQPNum
c = eCosts[i][j] + xCosts[i];
265
PBQPNum
min = eCosts[i][0] + xCosts[0];
267
PBQPNum
c = eCosts[i][j] + xCosts[j];
319
PBQPNum
min = (*yxeCosts)[i][0] + (*zxeCosts)[j][0] + xCosts[0];
321
PBQPNum
c = (*yxeCosts)[i][k] + (*zxeCosts)[j][k] + xCosts[k];
505
const
PBQPNum
infinity = std::numeric_limits<
PBQPNum
>::infinity();
512
PBQPNum
rowMin = infinity;
530
PBQPNum
colMin = infinity
[
all
...]
/external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
132
void addSpillCosts(PBQP::Vector &costVec, PBQP::
PBQPNum
spillCost);
153
PBQP::
PBQPNum
benefit);
158
PBQP::
PBQPNum
benefit);
/external/llvm/lib/CodeGen/
RegAllocPBQP.cpp
121
typedef std::map<RegPair, PBQP::
PBQPNum
> CoalesceMap;
256
PBQP::
PBQPNum
spillCost = (vregLI->weight != 0.0) ?
257
vregLI->weight : std::numeric_limits<PBQP::
PBQPNum
>::min();
289
PBQP::
PBQPNum
spillCost) {
308
costMat[i + 1][j + 1] = std::numeric_limits<PBQP::
PBQPNum
>::infinity();
351
PBQP::
PBQPNum
cBenefit =
398
PBQP::
PBQPNum
benefit) {
406
PBQP::
PBQPNum
benefit) {
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h
67
PBQPNum
cost1 = cv1[0] / s->getSolverDegree(n1Itr);
68
PBQPNum
cost2 = cv2[0] / s->getSolverDegree(n2Itr);
331
std::numeric_limits<
PBQPNum
>::infinity()) {
422
if (nCosts[i] == std::numeric_limits<
PBQPNum
>::infinity())
Completed in 48 milliseconds