Searched refs:Costs (Results 1 – 4 of 4) sorted by relevance
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 75 NodeEntry(VectorPtr Costs) : Costs(Costs) {} in NodeEntry() argument
97 VectorPtr Costs; variable
105 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument
106 : Costs(Costs) { in EdgeEntry()
117 Costs = nullptr; in invalidate()
169 MatrixPtr Costs; variable
382 NodeId addNode(OtherVectorT Costs) { in addNode() argument
384 VectorPtr AllocatedCosts = CostAlloc.getVector(std::move(Costs)); in addNode()
403 NodeId addNodeBypassingCostAllocator(OtherVectorPtrT Costs) { in addNodeBypassingCostAllocator() argument
404 NodeId NId = addConstructedNode(NodeEntry(Costs)); in addNodeBypassingCostAllocator()
[all …]
|
| /external/libvpx/libvpx/vp8/encoder/ |
| D | treewriter.h | 124 int *Costs, const vp8_prob *, vp8_tree
128 int *Costs, const vp8_prob *, vp8_tree, int
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 453 PBQPRAGraph::RawMatrix Costs(Allowed1->size() + 1, in apply() local
455 addVirtRegCoalesce(Costs, *Allowed1, *Allowed2, CBenefit); in apply()
456 G.addEdge(N1Id, N2Id, std::move(Costs)); in apply()
462 PBQPRAGraph::RawMatrix Costs(G.getEdgeCosts(EId)); in apply() local
463 addVirtRegCoalesce(Costs, *Allowed1, *Allowed2, CBenefit); in apply()
464 G.updateEdgeCosts(EId, std::move(Costs)); in apply()
823 const Vector &Costs = getNodeCosts(NId); in dump() local
824 assert(Costs.getLength() != 0 && "Empty vector in graph."); in dump()
825 OS << PrintNodeInfo(NId, *this) << ": " << Costs << '\n'; in dump()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 268 void setup(const Vector& Costs) { in setup() argument
269 NumOpts = Costs.getLength() - 1; in setup()
|