HomeSort by relevance Sort by last modified time
    Searched refs:Costs (Results 1 - 5 of 5) sorted by null

  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 75 NodeEntry(VectorPtr Costs) : Costs(Costs) {}
97 VectorPtr Costs;
105 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs)
106 : Costs(Costs) {
117 Costs = nullptr;
169 MatrixPtr Costs;
378 /// @brief Add a node with the given costs
    [all...]
  /external/libvpx/libvpx/vp8/encoder/
treewriter.h 121 /* Fill array of costs for all possible token values. */
124 int *Costs, const vp8_prob *, vp8_tree
128 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 153 /// @brief Set spill costs for each node in the PBQP reg-alloc graph.
159 // A minimum spill costs, so that register constraints can can be set
371 // Try looking the edge costs up in the IMatrixCache first.
453 PBQPRAGraph::RawMatrix Costs(Allowed1->size() + 1,
455 addVirtRegCoalesce(Costs, *Allowed1, *Allowed2, CBenefit);
456 G.addEdge(N1Id, N2Id, std::move(Costs));
462 PBQPRAGraph::RawMatrix Costs(G.getEdgeCosts(EId));
463 addVirtRegCoalesce(Costs, *Allowed1, *Allowed2, CBenefit);
464 G.updateEdgeCosts(EId, std::move(Costs));
823 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 178 milliseconds