We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4e83d4f commit 0ac2136Copy full SHA for 0ac2136
mlir/lib/Analysis/Presburger/Utils.cpp
@@ -324,6 +324,7 @@ int64_t presburger::normalizeRange(MutableArrayRef<int64_t> range) {
324
}
325
326
void presburger::normalizeDiv(MutableArrayRef<int64_t> num, int64_t &denom) {
327
+ assert(denom > 0 && "denom must be positive!");
328
int64_t gcd = llvm::greatestCommonDivisor(gcdRange(num), denom);
329
for (int64_t &coeff : num)
330
coeff /= gcd;
0 commit comments