Searched refs:getNumCols (Results 1 – 7 of 7) sorted by relevance
| /external/llvm-project/mlir/lib/Analysis/ |
| D | AffineStructures.cpp | 198 assert(flatExpr.size() == getNumCols()); in FlatAffineConstraints()
243 assert(other.getNumCols() == getNumCols()); in append()
285 if (getNumCols() + 1 > numReservedCols) { in addId()
286 equalities.resize(getNumEqualities() * (getNumCols() + 1)); in addId()
287 inequalities.resize(getNumInequalities() * (getNumCols() + 1)); in addId()
308 int numCols = static_cast<int>(getNumCols()); in addId()
502 SmallVector<int64_t, 8> eqToAdd(getNumCols(), 0); in composeMap()
523 eqToAdd[getNumCols() - 1] = -flatExpr[flatExpr.size() - 1]; in composeMap()
575 SmallVector<int64_t, 8> eqToAdd(getNumCols(), 0); in composeMatchingMap()
592 eqToAdd[getNumCols() - 1] = -flatExpr[flatExpr.size() - 1]; in composeMatchingMap()
[all …]
|
| D | AffineAnalysis.cpp | 378 SmallVector<int64_t, 4> cst(dependenceDomain->getNumCols()); in addDomainConstraints()
404 cst[cst.size() - 1] = at(i, domain.getNumCols() - 1); in addDomainConstraints()
486 SmallVector<int64_t, 8> eq(dependenceDomain->getNumCols()); in addMemRefAccessConstraints()
542 SmallVector<int64_t, 8> ineq(dependenceDomain->getNumCols()); in addMemRefAccessConstraints()
555 srcLocalVarCst.atIneq(r, srcLocalVarCst.getNumCols() - 1); in addMemRefAccessConstraints()
571 destLocalVarCst.atIneq(r, destLocalVarCst.getNumCols() - 1); in addMemRefAccessConstraints()
682 unsigned numCols = dependenceDomain->getNumCols(); in addOrderingConstraints()
726 eq.resize(dependenceDomain->getNumCols()); in computeDirectionVector()
|
| /external/llvm-project/mlir/include/mlir/IR/ |
| D | AffineExprVisitor.h | 314 inline unsigned getNumCols() const { in getNumCols() function
317 inline unsigned getConstantIndex() const { return getNumCols() - 1; } in getConstantIndex()
|
| /external/llvm-project/mlir/include/mlir/Analysis/ |
| D | AffineStructures.h | 187 inline unsigned getNumCols() const { return numIds + 1; } in getNumCols() function
210 return ArrayRef<int64_t>(&equalities[idx * numReservedCols], getNumCols()); in getEquality()
215 getNumCols()); in getInequality()
|
| /external/llvm-project/mlir/lib/IR/ |
| D | AffineExpr.cpp | 961 operandExprStack.emplace_back(SmallVector<int64_t, 32>(getNumCols(), 0)); in visitDimExpr()
968 operandExprStack.emplace_back(SmallVector<int64_t, 32>(getNumCols(), 0)); in visitSymbolExpr()
975 operandExprStack.emplace_back(SmallVector<int64_t, 32>(getNumCols(), 0)); in visitConstantExpr()
|
| /external/llvm-project/mlir/lib/Transforms/ |
| D | LoopFusion.cpp | 817 assert(lbs[d].size() == cst->getNumCols() - rank && "incorrect bound size"); in createPrivateMemRef()
820 for (unsigned j = 0, e = cst->getNumCols() - rank - 1; j < e; j++) { in createPrivateMemRef()
825 (offset + lbs[d][cst->getNumCols() - 1 - rank]).floorDiv(lbDivisors[d]); in createPrivateMemRef()
|
| /external/llvm-project/mlir/lib/Transforms/Utils/ |
| D | LoopUtils.cpp | 2396 assert(lbs[d].size() == cst->getNumCols() - rank && "incorrect bound size"); in generateCopy()
2399 for (unsigned j = 0, e = cst->getNumCols() - rank - 1; j < e; j++) in generateCopy()
2403 (offset + lbs[d][cst->getNumCols() - 1 - rank]).floorDiv(lbDivisors[d]); in generateCopy()
2976 for (unsigned i = 0, e = cst.getNumCols(); i < e; ++i) in createSeparationCondition()
2981 for (unsigned i = 0, e = cst.getNumCols(); i < e; ++i) in createSeparationCondition()
|