OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:getNodeCosts
(Results
1 - 8
of
8
) sorted by null
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
Graph.h
178
assert(
getNodeCosts
(n1Itr).getLength() == costs.getRows() &&
179
getNodeCosts
(n2Itr).getLength() == costs.getCols() &&
195
Vector&
getNodeCosts
(NodeItr nItr) { return getNode(nItr).getCosts(); }
200
const Vector&
getNodeCosts
(ConstNodeItr nItr) const {
364
<< nodeItr << ": " <<
getNodeCosts
(nodeItr) << "\" ]\n";
417
nodeMap[nItr] = addNode(other.
getNodeCosts
(nItr));
HeuristicSolver.h
245
const Vector &xCosts = g.
getNodeCosts
(xnItr);
250
Vector &yCosts = g.
getNodeCosts
(ynItr);
263
Vector &yCosts = g.
getNodeCosts
(ynItr);
291
const Vector &xCosts = g.
getNodeCosts
(xnItr);
444
if (g.
getNodeCosts
(nItr).getLength() == 1) {
456
g.
getNodeCosts
(otherNodeItr) +=
461
g.
getNodeCosts
(otherNodeItr) +=
508
Vector &uCosts = g.
getNodeCosts
(g.getEdgeNode1(eItr)),
509
&vCosts = g.
getNodeCosts
(g.getEdgeNode2(eItr));
561
Vector v(g.
getNodeCosts
(nItr))
[
all
...]
/external/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h
43
const Vector &XCosts = G.
getNodeCosts
(NId);
44
RawVector YCosts = G.
getNodeCosts
(MId);
83
const Vector &XCosts = G.
getNodeCosts
(NId);
190
RawVector v = G.
getNodeCosts
(NId);
Graph.h
417
assert(
getNodeCosts
(N1Id).getLength() == Costs.getRows() &&
418
getNodeCosts
(N2Id).getLength() == Costs.getCols() &&
443
assert(
getNodeCosts
(N1Id).getLength() == Costs->getRows() &&
444
getNodeCosts
(N2Id).getLength() == Costs->getCols() &&
481
///
getNodeCosts
where possible.
487
///
getNodeCosts
when dealing with node cost values.
495
const Vector&
getNodeCosts
(NodeId NId) const {
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h
65
const PBQP::Vector &cv1 = g->
getNodeCosts
(n1Itr);
66
const PBQP::Vector &cv2 = g->
getNodeCosts
(n2Itr);
362
unsigned numRegs = getGraph().
getNodeCosts
(nItr).getLength() - 1;
389
unsigned numRegs = getGraph().
getNodeCosts
(nItr).getLength() - 1;
408
unsigned numRegs = getGraph().
getNodeCosts
(nItr).getLength() - 1;
418
unsigned numRegs = getGraph().
getNodeCosts
(nItr).getLength() - 1;
/external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
360
assert(G.
getNodeCosts
(NId).getLength() > 1 &&
362
G.getNodeMetadata(NId).setup(G.
getNodeCosts
(NId));
548
PBQPNum N1SC = G.
getNodeCosts
(N1Id)[0];
549
PBQPNum N2SC = G.
getNodeCosts
(N2Id)[0];
/external/llvm/lib/CodeGen/
RegAllocPBQP.cpp
177
PBQPRAGraph::RawVector NodeCosts(G.
getNodeCosts
(NId));
446
PBQPRAGraph::RawVector NewCosts(G.
getNodeCosts
(NId));
842
const Vector &Costs =
getNodeCosts
(NId);
868
<<
getNodeCosts
(NId) << "\" ]\n";
/external/swiftshader/third_party/LLVM/lib/CodeGen/
RegAllocPBQP.cpp
282
addSpillCosts(g.
getNodeCosts
(node), spillCost);
392
addPhysRegCoalesce(g.
getNodeCosts
(node), pregOpt, cBenefit);
Completed in 189 milliseconds