OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Costs
(Results
1 - 5
of
5
) sorted by null
/external/llvm/include/llvm/CodeGen/PBQP/
Graph.h
74
NodeEntry(VectorPtr
Costs
) :
Costs
(
Costs
) {}
96
VectorPtr
Costs
;
104
EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr
Costs
)
105
:
Costs
(
Costs
) {
116
Costs
= nullptr;
168
MatrixPtr
Costs
;
377
/// @brief Add a node with the given
costs
[
all
...]
/external/libvpx/libvpx/vp8/encoder/
treewriter.h
120
/* Fill array of
costs
for all possible token values. */
123
int *
Costs
, const vp8_prob *, vp8_tree
127
int *
Costs
, const vp8_prob *, vp8_tree, int
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/
treewriter.h
120
/* Fill array of
costs
for all possible token values. */
123
int *
Costs
, const vp8_prob *, vp8_tree
127
int *
Costs
, const vp8_prob *, vp8_tree, int
/external/llvm/lib/CodeGen/
RegAllocPBQP.cpp
152
/// @brief Set spill
costs
for each node in the PBQP reg-alloc graph.
158
// A minimum spill
costs
, so that register constraints can can be set
370
// Try looking the edge
costs
up in the IMatrixCache first.
452
PBQPRAGraph::RawMatrix
Costs
(Allowed1->size() + 1,
454
addVirtRegCoalesce(
Costs
, *Allowed1, *Allowed2, CBenefit);
455
G.addEdge(N1Id, N2Id, std::move(
Costs
));
461
PBQPRAGraph::RawMatrix
Costs
(G.getEdgeCosts(EId));
462
addVirtRegCoalesce(
Costs
, *Allowed1, *Allowed2, CBenefit);
463
G.updateEdgeCosts(EId, std::move(
Costs
));
838
const Vector &
Costs
= getNodeCosts(NId)
[
all
...]
/external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
268
void setup(const Vector&
Costs
) {
269
NumOpts =
Costs
.getLength() - 1;
519
// register
costs
first (since early nodes are the most
Completed in 172 milliseconds