Home
last modified time | relevance | path

Searched refs:getRows (Results 1 – 8 of 8) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DMath.h161 unsigned getRows() const { in getRows() function
248 assert((M.getRows() != 0) && "Zero-row matrix badness.");
249 for (unsigned i = 0; i < M.getRows(); ++i)
H A DReductionRules.h105 YLen = YXECosts->getRows(), in applyR2()
106 ZLen = ZXECosts->getRows(); in applyR2()
H A DGraph.h410 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && in addEdge()
436 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && in addEdgeBypassingCostAllocator()
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFUnitIndex.h185 ArrayRef<Entry> getRows() const { in getRows() function
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp507 assert(CostMat.getRows() == Allowed1.size() + 1 && "Size mismatch."); in addVirtRegCoalesce()
914 assert(M.getRows() != 0 && "No rows in matrix."); in dump()
916 OS << PrintNodeInfo(N1Id, *this) << ' ' << M.getRows() << " rows / "; in dump()
941 for (unsigned i = 0; i < EdgeCosts.getRows(); ++i) { in printDot()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h56 : UnsafeRows(new bool[M.getRows() - 1]()), in MatrixMetadata()
60 for (unsigned i = 1; i < M.getRows(); ++i) { in MatrixMetadata()
/freebsd/contrib/llvm-project/llvm/lib/DWP/
H A DDWP.cpp212 for (const DWARFUnitIndex::Entry &E : TUIndex.getRows()) { in addAllTypesFromDWP()
840 for (const DWARFUnitIndex::Entry &E : CUIndex.getRows()) { in write()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFVerifier.cpp483 for (const DWARFUnitIndex::Entry &E : Index.getRows()) { in verifyIndex()