Searched refs:getCols (Results 1 – 10 of 10) sorted by relevance
47 UnsafeCols(new bool[M.getCols() - 1]()) { in MatrixMetadata()49 unsigned* ColCounts = new unsigned[M.getCols() - 1](); in MatrixMetadata()53 for (unsigned j = 1; j < M.getCols(); ++j) { in MatrixMetadata()64 *std::max_element(ColCounts, ColCounts + M.getCols() - 1); in MatrixMetadata()
132 (n2.getCosts().getLength() == ne.getCosts().getCols()) && in addConstructedEdge()179 getNodeCosts(n2Itr).getLength() == costs.getCols() && in addEdge()
514 for (unsigned c = 0; c < edgeCosts.getCols(); ++c) { in tryNormaliseEdgeMatrix()529 for (unsigned c = 0; c < edgeCosts.getCols(); ++c) { in tryNormaliseEdgeMatrix()
149 unsigned getCols() const { return cols; } in getCols() function
486 assert(CostMat.getCols() == Allowed2.size() + 1 && "Size mismatch."); in addVirtRegCoalesce()854 assert(M.getCols() != 0 && "No cols in matrix."); in dump()856 OS << PrintNodeInfo(N2Id, *this) << ' ' << M.getCols() << " cols:\n"; in dump()
418 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()444 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
231 unsigned getCols() const { in getCols() function
322 assert(costMat.getCols() == vr2Allowed.size() + 1 && "Matrix width mismatch."); in addInterferenceCosts()433 assert(costMat.getCols() == vr2Allowed.size() + 1 && "Size mismatch."); in addVirtRegCoalesce()
317 numReverseRegs = eCosts.getCols() - 1; in computeEdgeContributions()
606 int getCols() const in getCols() function